./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:50:41,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:50:41,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:50:41,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:50:41,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:50:41,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:50:41,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:50:41,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:50:41,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:50:41,664 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:50:41,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:50:41,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:50:41,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:50:41,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:50:41,665 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:50:41,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:50:41,665 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:50:41,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:50:41,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:50:41,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:50:41,665 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:50:41,665 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:50:41,665 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:50:41,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:50:41,666 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:50:41,666 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:50:41,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:50:41,666 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:50:41,666 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:50:41,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:50:41,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:50:41,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:50:41,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:50:41,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:50:41,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:50:41,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:50:41,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:50:41,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:50:41,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:50:41,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:50:41,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:50:41,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:50:41,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:50:41,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:50:41,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:50:41,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:50:41,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:50:41,668 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 -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 [2025-01-10 00:50:41,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:50:41,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:50:41,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:50:41,903 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:50:41,903 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:50:41,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-01-10 00:50:43,112 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/417d65207/88f81e9e5e8843359eefe3407e233dc4/FLAGa015d7a5d [2025-01-10 00:50:43,423 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:50:43,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-01-10 00:50:43,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/417d65207/88f81e9e5e8843359eefe3407e233dc4/FLAGa015d7a5d [2025-01-10 00:50:43,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/417d65207/88f81e9e5e8843359eefe3407e233dc4 [2025-01-10 00:50:43,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:50:43,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:50:43,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:50:43,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:50:43,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:50:43,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b2560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43, skipping insertion in model container [2025-01-10 00:50:43,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:50:43,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:50:43,710 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:50:43,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:50:43,790 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:50:43,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43 WrapperNode [2025-01-10 00:50:43,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:50:43,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:50:43,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:50:43,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:50:43,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,826 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2025-01-10 00:50:43,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:50:43,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:50:43,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:50:43,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:50:43,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,850 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:50:43,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,863 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:50:43,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:50:43,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:50:43,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:50:43,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43" (1/1) ... [2025-01-10 00:50:43,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:50:43,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:50:43,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:50:43,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:50:43,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:50:43,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:50:43,922 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:50:43,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:50:43,923 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:50:43,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:50:43,923 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:50:43,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:50:43,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:50:43,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:50:43,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:50:43,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:50:43,924 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:50:44,021 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:50:44,025 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:50:44,250 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:50:44,250 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:50:44,407 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:50:44,407 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:50:44,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:50:44 BoogieIcfgContainer [2025-01-10 00:50:44,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:50:44,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:50:44,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:50:44,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:50:44,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:50:43" (1/3) ... [2025-01-10 00:50:44,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66274f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:50:44, skipping insertion in model container [2025-01-10 00:50:44,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:43" (2/3) ... [2025-01-10 00:50:44,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66274f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:50:44, skipping insertion in model container [2025-01-10 00:50:44,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:50:44" (3/3) ... [2025-01-10 00:50:44,417 INFO L128 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-01-10 00:50:44,427 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:50:44,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 42 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:50:44,430 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:50:44,471 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:50:44,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2025-01-10 00:50:44,525 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2025-01-10 00:50:44,527 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:50:44,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-01-10 00:50:44,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2025-01-10 00:50:44,532 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 40 transitions, 89 flow [2025-01-10 00:50:44,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:50:44,545 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;@4c065f4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:50:44,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:50:44,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:50:44,548 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 00:50:44,548 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:50:44,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:44,548 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:50:44,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:44,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:44,552 INFO L85 PathProgramCache]: Analyzing trace with hash 11842232, now seen corresponding path program 1 times [2025-01-10 00:50:44,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:44,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554056049] [2025-01-10 00:50:44,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:44,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:44,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:50:44,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:50:44,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:44,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:50:44,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:44,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554056049] [2025-01-10 00:50:44,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554056049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:44,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:44,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:50:44,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549475291] [2025-01-10 00:50:44,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:44,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:50:44,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:44,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:50:44,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:50:44,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-01-10 00:50:44,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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-01-10 00:50:44,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:44,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-01-10 00:50:44,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:45,260 INFO L124 PetriNetUnfolderBase]: 680/1276 cut-off events. [2025-01-10 00:50:45,262 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-10 00:50:45,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 1276 events. 680/1276 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8113 event pairs, 104 based on Foata normal form. 72/1335 useless extension candidates. Maximal degree in co-relation 2341. Up to 844 conditions per place. [2025-01-10 00:50:45,274 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 33 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2025-01-10 00:50:45,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 193 flow [2025-01-10 00:50:45,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:50:45,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:50:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-01-10 00:50:45,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2025-01-10 00:50:45,289 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 89 flow. Second operand 3 states and 96 transitions. [2025-01-10 00:50:45,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 193 flow [2025-01-10 00:50:45,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:50:45,297 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2025-01-10 00:50:45,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-01-10 00:50:45,303 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2025-01-10 00:50:45,303 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2025-01-10 00:50:45,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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-01-10 00:50:45,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:45,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:45,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:50:45,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:45,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:45,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1141173135, now seen corresponding path program 1 times [2025-01-10 00:50:45,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:45,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800438467] [2025-01-10 00:50:45,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:45,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:45,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:50:45,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:50:45,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:45,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:50:45,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:45,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800438467] [2025-01-10 00:50:45,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800438467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:45,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:45,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:50:45,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588594790] [2025-01-10 00:50:45,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:45,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:50:45,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:45,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:50:45,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:50:45,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-01-10 00:50:45,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:45,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:45,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-01-10 00:50:45,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:45,608 INFO L124 PetriNetUnfolderBase]: 605/1133 cut-off events. [2025-01-10 00:50:45,608 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-01-10 00:50:45,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 1133 events. 605/1133 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6933 event pairs, 605 based on Foata normal form. 36/1130 useless extension candidates. Maximal degree in co-relation 2167. Up to 926 conditions per place. [2025-01-10 00:50:45,616 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 18 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2025-01-10 00:50:45,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 118 flow [2025-01-10 00:50:45,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:50:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:50:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-01-10 00:50:45,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2025-01-10 00:50:45,619 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 3 states and 72 transitions. [2025-01-10 00:50:45,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 118 flow [2025-01-10 00:50:45,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:50:45,620 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2025-01-10 00:50:45,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-01-10 00:50:45,621 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2025-01-10 00:50:45,621 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2025-01-10 00:50:45,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:45,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:45,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:45,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:50:45,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:45,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:45,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1141174531, now seen corresponding path program 1 times [2025-01-10 00:50:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:45,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018520682] [2025-01-10 00:50:45,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:45,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:45,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:50:45,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:50:45,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:45,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:50:46,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:46,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018520682] [2025-01-10 00:50:46,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018520682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:46,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:46,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:50:46,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750277068] [2025-01-10 00:50:46,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:46,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:50:46,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:46,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:50:46,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:50:46,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-10 00:50:46,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:46,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:46,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-10 00:50:46,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:47,271 INFO L124 PetriNetUnfolderBase]: 2216/3594 cut-off events. [2025-01-10 00:50:47,272 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:50:47,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6931 conditions, 3594 events. 2216/3594 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 22578 event pairs, 295 based on Foata normal form. 0/3503 useless extension candidates. Maximal degree in co-relation 6925. Up to 1815 conditions per place. [2025-01-10 00:50:47,284 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 41 selfloop transitions, 10 changer transitions 72/133 dead transitions. [2025-01-10 00:50:47,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 133 transitions, 528 flow [2025-01-10 00:50:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:50:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:50:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 294 transitions. [2025-01-10 00:50:47,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5697674418604651 [2025-01-10 00:50:47,290 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 12 states and 294 transitions. [2025-01-10 00:50:47,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 133 transitions, 528 flow [2025-01-10 00:50:47,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 133 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:50:47,292 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 170 flow [2025-01-10 00:50:47,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=170, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2025-01-10 00:50:47,293 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2025-01-10 00:50:47,293 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 170 flow [2025-01-10 00:50:47,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:47,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:47,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:47,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:50:47,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:47,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:47,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1468276514, now seen corresponding path program 1 times [2025-01-10 00:50:47,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:47,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353869249] [2025-01-10 00:50:47,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:47,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:47,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:50:47,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:50:47,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:47,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:50:47,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:47,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353869249] [2025-01-10 00:50:47,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353869249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:47,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:47,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:50:47,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951608207] [2025-01-10 00:50:47,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:47,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:50:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:47,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:50:47,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:50:47,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-01-10 00:50:47,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:47,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:47,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-01-10 00:50:47,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:48,585 INFO L124 PetriNetUnfolderBase]: 2132/3493 cut-off events. [2025-01-10 00:50:48,585 INFO L125 PetriNetUnfolderBase]: For 6890/6890 co-relation queries the response was YES. [2025-01-10 00:50:48,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11827 conditions, 3493 events. 2132/3493 cut-off events. For 6890/6890 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 21311 event pairs, 571 based on Foata normal form. 91/3580 useless extension candidates. Maximal degree in co-relation 11811. Up to 2229 conditions per place. [2025-01-10 00:50:48,610 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 44 selfloop transitions, 16 changer transitions 55/124 dead transitions. [2025-01-10 00:50:48,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 124 transitions, 814 flow [2025-01-10 00:50:48,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:50:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:50:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 238 transitions. [2025-01-10 00:50:48,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5534883720930233 [2025-01-10 00:50:48,612 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 170 flow. Second operand 10 states and 238 transitions. [2025-01-10 00:50:48,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 124 transitions, 814 flow [2025-01-10 00:50:48,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 124 transitions, 738 flow, removed 38 selfloop flow, removed 5 redundant places. [2025-01-10 00:50:48,654 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 274 flow [2025-01-10 00:50:48,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=274, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2025-01-10 00:50:48,654 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2025-01-10 00:50:48,654 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 274 flow [2025-01-10 00:50:48,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:48,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:48,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:48,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:50:48,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:48,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:48,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1190111313, now seen corresponding path program 1 times [2025-01-10 00:50:48,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:48,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120247637] [2025-01-10 00:50:48,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:48,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:48,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:50:48,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:50:48,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:48,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:50:49,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:49,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120247637] [2025-01-10 00:50:49,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120247637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:49,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:49,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:50:49,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506896088] [2025-01-10 00:50:49,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:49,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:50:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:49,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:50:49,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:50:49,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-10 00:50:49,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:49,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:49,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-10 00:50:49,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:49,687 INFO L124 PetriNetUnfolderBase]: 2373/4056 cut-off events. [2025-01-10 00:50:49,687 INFO L125 PetriNetUnfolderBase]: For 15110/15170 co-relation queries the response was YES. [2025-01-10 00:50:49,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16818 conditions, 4056 events. 2373/4056 cut-off events. For 15110/15170 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 27143 event pairs, 543 based on Foata normal form. 165/4180 useless extension candidates. Maximal degree in co-relation 16797. Up to 1595 conditions per place. [2025-01-10 00:50:49,713 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 53 selfloop transitions, 9 changer transitions 33/106 dead transitions. [2025-01-10 00:50:49,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 106 transitions, 836 flow [2025-01-10 00:50:49,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:50:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:50:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2025-01-10 00:50:49,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5697674418604651 [2025-01-10 00:50:49,715 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 274 flow. Second operand 8 states and 196 transitions. [2025-01-10 00:50:49,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 106 transitions, 836 flow [2025-01-10 00:50:49,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 764 flow, removed 36 selfloop flow, removed 4 redundant places. [2025-01-10 00:50:49,734 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 329 flow [2025-01-10 00:50:49,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=329, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2025-01-10 00:50:49,735 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2025-01-10 00:50:49,735 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 329 flow [2025-01-10 00:50:49,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:49,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:49,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:49,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:50:49,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:49,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:49,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1963849658, now seen corresponding path program 1 times [2025-01-10 00:50:49,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:49,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539327051] [2025-01-10 00:50:49,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:49,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:49,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:50:49,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:50:49,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:49,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:50:50,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:50,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539327051] [2025-01-10 00:50:50,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539327051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:50,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:50,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:50:50,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083483400] [2025-01-10 00:50:50,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:50,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:50:50,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:50,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:50:50,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:50:50,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-10 00:50:50,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:50,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:50,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-10 00:50:50,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:50,852 INFO L124 PetriNetUnfolderBase]: 2189/3864 cut-off events. [2025-01-10 00:50:50,853 INFO L125 PetriNetUnfolderBase]: For 12521/12541 co-relation queries the response was YES. [2025-01-10 00:50:50,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15355 conditions, 3864 events. 2189/3864 cut-off events. For 12521/12541 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 25988 event pairs, 439 based on Foata normal form. 137/3992 useless extension candidates. Maximal degree in co-relation 15330. Up to 2042 conditions per place. [2025-01-10 00:50:50,877 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 49 selfloop transitions, 11 changer transitions 48/119 dead transitions. [2025-01-10 00:50:50,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 119 transitions, 1010 flow [2025-01-10 00:50:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:50:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:50:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2025-01-10 00:50:50,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255813953488372 [2025-01-10 00:50:50,880 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 329 flow. Second operand 10 states and 226 transitions. [2025-01-10 00:50:50,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 119 transitions, 1010 flow [2025-01-10 00:50:50,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 119 transitions, 953 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-01-10 00:50:50,910 INFO L231 Difference]: Finished difference. Result has 76 places, 55 transitions, 407 flow [2025-01-10 00:50:50,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=407, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2025-01-10 00:50:50,911 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2025-01-10 00:50:50,911 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 407 flow [2025-01-10 00:50:50,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:50,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:50,911 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] [2025-01-10 00:50:50,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:50:50,911 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:50,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:50,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1127830320, now seen corresponding path program 1 times [2025-01-10 00:50:50,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:50,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160462887] [2025-01-10 00:50:50,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:50,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:50,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:50:50,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:50:50,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:50,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:50:51,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:51,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160462887] [2025-01-10 00:50:51,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160462887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:51,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:51,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:50:51,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150109711] [2025-01-10 00:50:51,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:51,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:50:51,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:51,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:50:51,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:50:51,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2025-01-10 00:50:51,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 407 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:51,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:51,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2025-01-10 00:50:51,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:51,696 INFO L124 PetriNetUnfolderBase]: 1806/3150 cut-off events. [2025-01-10 00:50:51,696 INFO L125 PetriNetUnfolderBase]: For 11667/11844 co-relation queries the response was YES. [2025-01-10 00:50:51,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13263 conditions, 3150 events. 1806/3150 cut-off events. For 11667/11844 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20359 event pairs, 914 based on Foata normal form. 184/3271 useless extension candidates. Maximal degree in co-relation 13232. Up to 2178 conditions per place. [2025-01-10 00:50:51,712 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 39 selfloop transitions, 13 changer transitions 32/105 dead transitions. [2025-01-10 00:50:51,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 105 transitions, 909 flow [2025-01-10 00:50:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:50:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:50:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2025-01-10 00:50:51,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5668604651162791 [2025-01-10 00:50:51,713 INFO L175 Difference]: Start difference. First operand has 76 places, 55 transitions, 407 flow. Second operand 8 states and 195 transitions. [2025-01-10 00:50:51,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 105 transitions, 909 flow [2025-01-10 00:50:51,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 105 transitions, 881 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-01-10 00:50:51,732 INFO L231 Difference]: Finished difference. Result has 78 places, 59 transitions, 487 flow [2025-01-10 00:50:51,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=487, PETRI_PLACES=78, PETRI_TRANSITIONS=59} [2025-01-10 00:50:51,733 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 30 predicate places. [2025-01-10 00:50:51,733 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 59 transitions, 487 flow [2025-01-10 00:50:51,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:51,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:51,733 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-01-10 00:50:51,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:50:51,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:51,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1205174585, now seen corresponding path program 1 times [2025-01-10 00:50:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:51,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122556131] [2025-01-10 00:50:51,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:51,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:51,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:50:51,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:50:51,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:51,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:50:52,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:52,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122556131] [2025-01-10 00:50:52,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122556131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:52,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:52,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:50:52,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067237892] [2025-01-10 00:50:52,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:52,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:50:52,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:52,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:50:52,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:50:52,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2025-01-10 00:50:52,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 59 transitions, 487 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:52,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:52,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2025-01-10 00:50:52,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:52,755 INFO L124 PetriNetUnfolderBase]: 1910/3377 cut-off events. [2025-01-10 00:50:52,756 INFO L125 PetriNetUnfolderBase]: For 15604/15791 co-relation queries the response was YES. [2025-01-10 00:50:52,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14989 conditions, 3377 events. 1910/3377 cut-off events. For 15604/15791 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 22301 event pairs, 693 based on Foata normal form. 240/3574 useless extension candidates. Maximal degree in co-relation 14955. Up to 2214 conditions per place. [2025-01-10 00:50:52,780 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 51 selfloop transitions, 9 changer transitions 36/117 dead transitions. [2025-01-10 00:50:52,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 117 transitions, 1121 flow [2025-01-10 00:50:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:50:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:50:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2025-01-10 00:50:52,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5726744186046512 [2025-01-10 00:50:52,784 INFO L175 Difference]: Start difference. First operand has 78 places, 59 transitions, 487 flow. Second operand 8 states and 197 transitions. [2025-01-10 00:50:52,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 117 transitions, 1121 flow [2025-01-10 00:50:52,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 117 transitions, 1065 flow, removed 25 selfloop flow, removed 7 redundant places. [2025-01-10 00:50:52,839 INFO L231 Difference]: Finished difference. Result has 79 places, 63 transitions, 544 flow [2025-01-10 00:50:52,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=544, PETRI_PLACES=79, PETRI_TRANSITIONS=63} [2025-01-10 00:50:52,842 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2025-01-10 00:50:52,842 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 63 transitions, 544 flow [2025-01-10 00:50:52,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:52,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:52,843 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] [2025-01-10 00:50:52,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:50:52,843 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:52,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash 17697365, now seen corresponding path program 1 times [2025-01-10 00:50:52,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:52,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654824384] [2025-01-10 00:50:52,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:52,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:52,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:50:52,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:50:52,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:52,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:50:53,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:53,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654824384] [2025-01-10 00:50:53,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654824384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:53,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:53,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:50:53,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382791298] [2025-01-10 00:50:53,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:53,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:50:53,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:53,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:50:53,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:50:53,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2025-01-10 00:50:53,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 63 transitions, 544 flow. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:53,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:53,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2025-01-10 00:50:53,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:53,960 INFO L124 PetriNetUnfolderBase]: 2010/3549 cut-off events. [2025-01-10 00:50:53,960 INFO L125 PetriNetUnfolderBase]: For 25680/25819 co-relation queries the response was YES. [2025-01-10 00:50:53,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18573 conditions, 3549 events. 2010/3549 cut-off events. For 25680/25819 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 23385 event pairs, 486 based on Foata normal form. 188/3712 useless extension candidates. Maximal degree in co-relation 18539. Up to 2230 conditions per place. [2025-01-10 00:50:53,986 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 59 selfloop transitions, 26 changer transitions 49/155 dead transitions. [2025-01-10 00:50:53,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 155 transitions, 1781 flow [2025-01-10 00:50:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:50:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:50:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 264 transitions. [2025-01-10 00:50:53,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2025-01-10 00:50:53,991 INFO L175 Difference]: Start difference. First operand has 79 places, 63 transitions, 544 flow. Second operand 11 states and 264 transitions. [2025-01-10 00:50:53,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 155 transitions, 1781 flow [2025-01-10 00:50:54,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 155 transitions, 1737 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-01-10 00:50:54,030 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 909 flow [2025-01-10 00:50:54,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=909, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2025-01-10 00:50:54,031 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 42 predicate places. [2025-01-10 00:50:54,031 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 909 flow [2025-01-10 00:50:54,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:54,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:54,031 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] [2025-01-10 00:50:54,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:50:54,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:54,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:54,032 INFO L85 PathProgramCache]: Analyzing trace with hash 723154124, now seen corresponding path program 1 times [2025-01-10 00:50:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:54,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61550762] [2025-01-10 00:50:54,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:54,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:54,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:50:54,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:50:54,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:54,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:50:54,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:54,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61550762] [2025-01-10 00:50:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61550762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:54,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:54,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:50:54,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881590154] [2025-01-10 00:50:54,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:54,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:50:54,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:54,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:50:54,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:50:54,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-10 00:50:54,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 909 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:54,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:54,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-10 00:50:54,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:54,346 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L769-->L776: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_61 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_76 256) 0)))) (.cse0 (and .cse5 .cse2))) (and (= v_~y$w_buff1_used~0_60 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_61) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256))) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_60 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) 256) 0) 0 1) v_~y$r_buff1_thd2~0_27) (= v_~y~0_21 (ite .cse4 v_~y$w_buff0~0_21 (ite .cse1 v_~y$w_buff1~0_16 v_~y~0_22))) (= v_~y$w_buff0_used~0_75 (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_76) 256) 0) 0 1)) (= (ite (= (mod (ite .cse0 0 v_~y$r_buff0_thd2~0_30) 256) 0) 0 1) v_~y$r_buff0_thd2~0_29)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_76, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_22, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_21, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_60} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][42], [60#true, 30#L776true, 50#true, 87#true, Black: 75#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 73#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 63#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 132#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 62#(= ~x~0 0), Black: 208#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 131#(= ~__unbuffered_p2_EAX~0 0), Black: 199#(not (= (mod ~main$tmp_guard1~0 256) 0)), Black: 210#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0))), Black: 206#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 196#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0)), 48#true, Black: 202#(and (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (<= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 19#L759true, Black: 204#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 212#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 59#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 193#true, Black: 90#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 158#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 89#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 52#true, Black: 94#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 34#L821true, 227#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 31#L789true, 129#true, Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 113#(= ~x~0 1), Black: 185#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 114#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 176#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0))]) [2025-01-10 00:50:54,348 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2025-01-10 00:50:54,348 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2025-01-10 00:50:54,348 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2025-01-10 00:50:54,348 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2025-01-10 00:50:54,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L769-->L776: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_61 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_76 256) 0)))) (.cse0 (and .cse5 .cse2))) (and (= v_~y$w_buff1_used~0_60 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_61) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256))) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_60 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) 256) 0) 0 1) v_~y$r_buff1_thd2~0_27) (= v_~y~0_21 (ite .cse4 v_~y$w_buff0~0_21 (ite .cse1 v_~y$w_buff1~0_16 v_~y~0_22))) (= v_~y$w_buff0_used~0_75 (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_76) 256) 0) 0 1)) (= (ite (= (mod (ite .cse0 0 v_~y$r_buff0_thd2~0_30) 256) 0) 0 1) v_~y$r_buff0_thd2~0_29)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_76, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_22, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_21, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_60} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][41], [60#true, 30#L776true, 50#true, 87#true, Black: 75#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 73#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 225#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 132#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 63#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 62#(= ~x~0 0), Black: 208#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 131#(= ~__unbuffered_p2_EAX~0 0), Black: 199#(not (= (mod ~main$tmp_guard1~0 256) 0)), Black: 210#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0))), Black: 206#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 196#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0)), 48#true, Black: 202#(and (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (<= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 212#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 59#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 193#true, Black: 90#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 14#L762true, Black: 96#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 158#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 89#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 52#true, Black: 94#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 34#L821true, 31#L789true, 129#true, Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 113#(= ~x~0 1), Black: 185#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 114#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 176#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0))]) [2025-01-10 00:50:54,354 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-01-10 00:50:54,354 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-10 00:50:54,354 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-10 00:50:54,354 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-10 00:50:54,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L769-->L776: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_61 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_76 256) 0)))) (.cse0 (and .cse5 .cse2))) (and (= v_~y$w_buff1_used~0_60 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_61) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256))) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_60 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) 256) 0) 0 1) v_~y$r_buff1_thd2~0_27) (= v_~y~0_21 (ite .cse4 v_~y$w_buff0~0_21 (ite .cse1 v_~y$w_buff1~0_16 v_~y~0_22))) (= v_~y$w_buff0_used~0_75 (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_76) 256) 0) 0 1)) (= (ite (= (mod (ite .cse0 0 v_~y$r_buff0_thd2~0_30) 256) 0) 0 1) v_~y$r_buff0_thd2~0_29)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_76, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_22, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_21, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_60} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][41], [60#true, 30#L776true, 50#true, 87#true, Black: 75#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 73#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 225#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 132#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 63#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 62#(= ~x~0 0), Black: 208#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 131#(= ~__unbuffered_p2_EAX~0 0), Black: 199#(not (= (mod ~main$tmp_guard1~0 256) 0)), Black: 210#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0))), Black: 206#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 196#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0)), 48#true, Black: 202#(and (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (<= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 212#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 59#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 193#true, Black: 90#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 158#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 89#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 52#true, Black: 94#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 38#P0EXITtrue, 34#L821true, 31#L789true, 129#true, Black: 113#(= ~x~0 1), Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 185#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 114#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 176#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0))]) [2025-01-10 00:50:54,396 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-01-10 00:50:54,396 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-10 00:50:54,396 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-10 00:50:54,396 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-10 00:50:54,651 INFO L124 PetriNetUnfolderBase]: 3640/5741 cut-off events. [2025-01-10 00:50:54,652 INFO L125 PetriNetUnfolderBase]: For 72038/73542 co-relation queries the response was YES. [2025-01-10 00:50:54,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31363 conditions, 5741 events. 3640/5741 cut-off events. For 72038/73542 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 34021 event pairs, 623 based on Foata normal form. 529/5982 useless extension candidates. Maximal degree in co-relation 31322. Up to 3028 conditions per place. [2025-01-10 00:50:54,675 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 82 selfloop transitions, 5 changer transitions 11/121 dead transitions. [2025-01-10 00:50:54,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 121 transitions, 1594 flow [2025-01-10 00:50:54,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:50:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:50:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-01-10 00:50:54,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2025-01-10 00:50:54,678 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 909 flow. Second operand 4 states and 104 transitions. [2025-01-10 00:50:54,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 121 transitions, 1594 flow [2025-01-10 00:50:54,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 121 transitions, 1490 flow, removed 52 selfloop flow, removed 6 redundant places. [2025-01-10 00:50:54,711 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 768 flow [2025-01-10 00:50:54,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=768, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2025-01-10 00:50:54,712 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 35 predicate places. [2025-01-10 00:50:54,713 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 768 flow [2025-01-10 00:50:54,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:54,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:54,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:54,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:50:54,713 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:54,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:54,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1664042334, now seen corresponding path program 1 times [2025-01-10 00:50:54,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:54,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182488461] [2025-01-10 00:50:54,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:54,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:50:54,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:50:54,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:54,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:50:54,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:54,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182488461] [2025-01-10 00:50:54,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182488461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:54,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:54,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:50:54,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568360544] [2025-01-10 00:50:54,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:54,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:50:54,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:54,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:50:54,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:50:54,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-10 00:50:54,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 768 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:54,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:54,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-10 00:50:54,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:55,403 INFO L124 PetriNetUnfolderBase]: 2957/5180 cut-off events. [2025-01-10 00:50:55,403 INFO L125 PetriNetUnfolderBase]: For 40904/41319 co-relation queries the response was YES. [2025-01-10 00:50:55,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26426 conditions, 5180 events. 2957/5180 cut-off events. For 40904/41319 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 36687 event pairs, 968 based on Foata normal form. 149/5054 useless extension candidates. Maximal degree in co-relation 26387. Up to 1884 conditions per place. [2025-01-10 00:50:55,425 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 65 selfloop transitions, 6 changer transitions 45/135 dead transitions. [2025-01-10 00:50:55,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 135 transitions, 1576 flow [2025-01-10 00:50:55,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:50:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:50:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2025-01-10 00:50:55,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5614617940199336 [2025-01-10 00:50:55,428 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 768 flow. Second operand 7 states and 169 transitions. [2025-01-10 00:50:55,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 135 transitions, 1576 flow [2025-01-10 00:50:55,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 135 transitions, 1574 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:50:55,451 INFO L231 Difference]: Finished difference. Result has 92 places, 75 transitions, 781 flow [2025-01-10 00:50:55,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=781, PETRI_PLACES=92, PETRI_TRANSITIONS=75} [2025-01-10 00:50:55,452 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 44 predicate places. [2025-01-10 00:50:55,452 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 781 flow [2025-01-10 00:50:55,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:55,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:55,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:55,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:50:55,452 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:55,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1529376862, now seen corresponding path program 2 times [2025-01-10 00:50:55,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:55,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184711398] [2025-01-10 00:50:55,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:50:55,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:55,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:50:55,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:50:55,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:50:55,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:50:55,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:55,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184711398] [2025-01-10 00:50:55,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184711398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:55,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:55,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:50:55,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215733770] [2025-01-10 00:50:55,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:55,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:50:55,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:55,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:50:55,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:50:55,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-10 00:50:55,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 781 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:55,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:55,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-10 00:50:55,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:55,984 INFO L124 PetriNetUnfolderBase]: 2547/4134 cut-off events. [2025-01-10 00:50:55,984 INFO L125 PetriNetUnfolderBase]: For 44342/44893 co-relation queries the response was YES. [2025-01-10 00:50:55,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21514 conditions, 4134 events. 2547/4134 cut-off events. For 44342/44893 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23822 event pairs, 375 based on Foata normal form. 374/4283 useless extension candidates. Maximal degree in co-relation 21471. Up to 1246 conditions per place. [2025-01-10 00:50:56,002 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 82 selfloop transitions, 8 changer transitions 7/119 dead transitions. [2025-01-10 00:50:56,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 119 transitions, 1430 flow [2025-01-10 00:50:56,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:50:56,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:50:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2025-01-10 00:50:56,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6139534883720931 [2025-01-10 00:50:56,004 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 781 flow. Second operand 5 states and 132 transitions. [2025-01-10 00:50:56,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 119 transitions, 1430 flow [2025-01-10 00:50:56,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 119 transitions, 1400 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 00:50:56,021 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 751 flow [2025-01-10 00:50:56,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2025-01-10 00:50:56,022 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 40 predicate places. [2025-01-10 00:50:56,022 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 751 flow [2025-01-10 00:50:56,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:56,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:56,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:56,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:50:56,022 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:56,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:56,023 INFO L85 PathProgramCache]: Analyzing trace with hash -307555067, now seen corresponding path program 1 times [2025-01-10 00:50:56,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:56,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798440789] [2025-01-10 00:50:56,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:56,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:56,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:50:56,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:50:56,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:56,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:50:56,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:56,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798440789] [2025-01-10 00:50:56,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798440789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:56,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:56,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:50:56,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384828487] [2025-01-10 00:50:56,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:56,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:50:56,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:56,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:50:56,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:50:56,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-10 00:50:56,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 751 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:56,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:56,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-10 00:50:56,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:56,585 INFO L124 PetriNetUnfolderBase]: 1995/3215 cut-off events. [2025-01-10 00:50:56,585 INFO L125 PetriNetUnfolderBase]: For 37370/37846 co-relation queries the response was YES. [2025-01-10 00:50:56,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17835 conditions, 3215 events. 1995/3215 cut-off events. For 37370/37846 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 18236 event pairs, 329 based on Foata normal form. 247/3246 useless extension candidates. Maximal degree in co-relation 17793. Up to 1195 conditions per place. [2025-01-10 00:50:56,599 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 68 selfloop transitions, 11 changer transitions 14/113 dead transitions. [2025-01-10 00:50:56,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 113 transitions, 1281 flow [2025-01-10 00:50:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:50:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:50:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-01-10 00:50:56,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2025-01-10 00:50:56,600 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 751 flow. Second operand 6 states and 144 transitions. [2025-01-10 00:50:56,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 113 transitions, 1281 flow [2025-01-10 00:50:56,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 113 transitions, 1180 flow, removed 38 selfloop flow, removed 4 redundant places. [2025-01-10 00:50:56,619 INFO L231 Difference]: Finished difference. Result has 91 places, 70 transitions, 654 flow [2025-01-10 00:50:56,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=654, PETRI_PLACES=91, PETRI_TRANSITIONS=70} [2025-01-10 00:50:56,619 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 43 predicate places. [2025-01-10 00:50:56,620 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 70 transitions, 654 flow [2025-01-10 00:50:56,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:56,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:56,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:56,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:50:56,620 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:56,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1986173737, now seen corresponding path program 1 times [2025-01-10 00:50:56,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:56,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576918846] [2025-01-10 00:50:56,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:56,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:56,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:50:56,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:50:56,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:56,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:50:57,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:57,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576918846] [2025-01-10 00:50:57,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576918846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:57,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:57,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:50:57,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384694164] [2025-01-10 00:50:57,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:57,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:50:57,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:57,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:50:57,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:50:57,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2025-01-10 00:50:57,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 70 transitions, 654 flow. Second operand has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:57,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:57,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2025-01-10 00:50:57,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:58,067 INFO L124 PetriNetUnfolderBase]: 1464/2943 cut-off events. [2025-01-10 00:50:58,067 INFO L125 PetriNetUnfolderBase]: For 21406/22074 co-relation queries the response was YES. [2025-01-10 00:50:58,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13268 conditions, 2943 events. 1464/2943 cut-off events. For 21406/22074 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 21829 event pairs, 283 based on Foata normal form. 123/2788 useless extension candidates. Maximal degree in co-relation 13226. Up to 1171 conditions per place. [2025-01-10 00:50:58,081 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 36 selfloop transitions, 14 changer transitions 23/102 dead transitions. [2025-01-10 00:50:58,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 102 transitions, 1010 flow [2025-01-10 00:50:58,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:50:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:50:58,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2025-01-10 00:50:58,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5290697674418605 [2025-01-10 00:50:58,082 INFO L175 Difference]: Start difference. First operand has 91 places, 70 transitions, 654 flow. Second operand 8 states and 182 transitions. [2025-01-10 00:50:58,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 102 transitions, 1010 flow [2025-01-10 00:50:58,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 102 transitions, 872 flow, removed 59 selfloop flow, removed 11 redundant places. [2025-01-10 00:50:58,108 INFO L231 Difference]: Finished difference. Result has 91 places, 66 transitions, 577 flow [2025-01-10 00:50:58,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=577, PETRI_PLACES=91, PETRI_TRANSITIONS=66} [2025-01-10 00:50:58,109 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 43 predicate places. [2025-01-10 00:50:58,109 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 66 transitions, 577 flow [2025-01-10 00:50:58,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:58,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:58,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:58,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:50:58,110 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:50:58,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:58,110 INFO L85 PathProgramCache]: Analyzing trace with hash -345371585, now seen corresponding path program 2 times [2025-01-10 00:50:58,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:58,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225644597] [2025-01-10 00:50:58,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:50:58,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:58,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:50:58,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:50:58,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:50:58,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:50:58,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:50:58,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:50:58,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:50:58,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:58,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:50:58,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:50:58,250 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:50:58,251 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-01-10 00:50:58,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 00:50:58,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-01-10 00:50:58,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-10 00:50:58,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-01-10 00:50:58,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-01-10 00:50:58,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:50:58,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:50:58,253 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:58,315 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:50:58,318 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:50:58,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:50:58 BasicIcfg [2025-01-10 00:50:58,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:50:58,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:50:58,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:50:58,323 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:50:58,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:50:44" (3/4) ... [2025-01-10 00:50:58,325 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:50:58,326 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:50:58,327 INFO L158 Benchmark]: Toolchain (without parser) took 14879.83ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 113.3MB in the beginning and 1.1GB in the end (delta: -942.9MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2025-01-10 00:50:58,327 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:50:58,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.35ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 90.0MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:50:58,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.33ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:50:58,328 INFO L158 Benchmark]: Boogie Preprocessor took 44.97ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 84.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:50:58,328 INFO L158 Benchmark]: RCFGBuilder took 535.24ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 102.4MB in the end (delta: -17.8MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2025-01-10 00:50:58,328 INFO L158 Benchmark]: TraceAbstraction took 13913.49ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 101.6MB in the beginning and 1.1GB in the end (delta: -954.8MB). Peak memory consumption was 649.8MB. Max. memory is 16.1GB. [2025-01-10 00:50:58,328 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 1.1GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 152.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:50:58,330 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.12ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.35ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 90.0MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.33ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.97ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 84.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 535.24ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 102.4MB in the end (delta: -17.8MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13913.49ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 101.6MB in the beginning and 1.1GB in the end (delta: -954.8MB). Peak memory consumption was 649.8MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 1.1GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 152.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, t2178=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 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) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 706 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 672 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1955 IncrementalHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 52 mSDtfsCounter, 1955 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=909occurred in iteration=9, InterpolantAutomatonStates: 103, 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, 5.1s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 2268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 00:50:58,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:51:00,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:51:00,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-10 00:51:00,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:51:00,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:51:00,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:51:00,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:51:00,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:51:00,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:51:00,532 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:51:00,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:51:00,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:51:00,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:51:00,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:51:00,532 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:51:00,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:51:00,533 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:51:00,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:51:00,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:51:00,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:51:00,533 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:51:00,533 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:51:00,533 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:51:00,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:51:00,533 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:51:00,533 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:51:00,533 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:51:00,534 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:51:00,534 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:51:00,534 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:51:00,534 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:51:00,534 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:51:00,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:51:00,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:51:00,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:51:00,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:51:00,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:51:00,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:51:00,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:51:00,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:51:00,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:51:00,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:51:00,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:51:00,535 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:51:00,535 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:51:00,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:51:00,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:51:00,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:51:00,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:51:00,536 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 -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 [2025-01-10 00:51:00,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:51:00,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:51:00,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:51:00,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:51:00,842 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:51:00,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-01-10 00:51:02,156 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e8b75195/faeafb0acdcb498dbe5890f52a85d098/FLAGc52332622 [2025-01-10 00:51:02,428 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:51:02,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-01-10 00:51:02,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e8b75195/faeafb0acdcb498dbe5890f52a85d098/FLAGc52332622 [2025-01-10 00:51:02,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e8b75195/faeafb0acdcb498dbe5890f52a85d098 [2025-01-10 00:51:02,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:51:02,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:51:02,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:51:02,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:51:02,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:51:02,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:02" (1/1) ... [2025-01-10 00:51:02,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3210be1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:02, skipping insertion in model container [2025-01-10 00:51:02,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:02" (1/1) ... [2025-01-10 00:51:02,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:51:03,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:51:03,258 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:51:03,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:51:03,353 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:51:03,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03 WrapperNode [2025-01-10 00:51:03,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:51:03,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:51:03,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:51:03,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:51:03,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03" (1/1) ... [2025-01-10 00:51:03,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03" (1/1) ... [2025-01-10 00:51:03,387 INFO L138 Inliner]: procedures = 176, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2025-01-10 00:51:03,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:51:03,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:51:03,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:51:03,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:51:03,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03" (1/1) ... [2025-01-10 00:51:03,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03" (1/1) ... [2025-01-10 00:51:03,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03" (1/1) ... [2025-01-10 00:51:03,415 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:51:03,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03" (1/1) ... [2025-01-10 00:51:03,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03" (1/1) ... [2025-01-10 00:51:03,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03" (1/1) ... [2025-01-10 00:51:03,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03" (1/1) ... [2025-01-10 00:51:03,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03" (1/1) ... [2025-01-10 00:51:03,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03" (1/1) ... [2025-01-10 00:51:03,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03" (1/1) ... [2025-01-10 00:51:03,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:51:03,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:51:03,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:51:03,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:51:03,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03" (1/1) ... [2025-01-10 00:51:03,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:51:03,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:03,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:51:03,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:51:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:51:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:51:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 00:51:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:51:03,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:51:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:51:03,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:51:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:51:03,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:51:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:51:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:51:03,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:51:03,479 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:51:03,623 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:51:03,624 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:51:03,900 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:51:03,900 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:51:04,093 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:51:04,093 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:51:04,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:04 BoogieIcfgContainer [2025-01-10 00:51:04,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:51:04,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:51:04,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:51:04,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:51:04,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:51:02" (1/3) ... [2025-01-10 00:51:04,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c86333e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:04, skipping insertion in model container [2025-01-10 00:51:04,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03" (2/3) ... [2025-01-10 00:51:04,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c86333e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:04, skipping insertion in model container [2025-01-10 00:51:04,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:04" (3/3) ... [2025-01-10 00:51:04,099 INFO L128 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-01-10 00:51:04,108 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:51:04,109 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 42 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:51:04,109 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:51:04,172 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:51:04,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2025-01-10 00:51:04,274 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2025-01-10 00:51:04,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:04,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-01-10 00:51:04,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2025-01-10 00:51:04,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 40 transitions, 89 flow [2025-01-10 00:51:04,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:51:04,317 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;@562af60d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:51:04,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:51:04,324 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:51:04,326 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 00:51:04,326 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:04,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:04,327 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:51:04,328 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:51:04,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:04,339 INFO L85 PathProgramCache]: Analyzing trace with hash 11903800, now seen corresponding path program 1 times [2025-01-10 00:51:04,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:04,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [10063604] [2025-01-10 00:51:04,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:04,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:04,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:04,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:51:04,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:51:04,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:51:04,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:51:04,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:04,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:04,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:51:04,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:04,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:04,452 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:04,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10063604] [2025-01-10 00:51:04,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10063604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:04,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:04,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:51:04,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426630352] [2025-01-10 00:51:04,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:04,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:51:04,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:04,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:51:04,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:51:04,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-01-10 00:51:04,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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-01-10 00:51:04,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:04,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-01-10 00:51:04,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:04,856 INFO L124 PetriNetUnfolderBase]: 680/1276 cut-off events. [2025-01-10 00:51:04,856 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-10 00:51:04,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 1276 events. 680/1276 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8113 event pairs, 104 based on Foata normal form. 72/1335 useless extension candidates. Maximal degree in co-relation 2341. Up to 844 conditions per place. [2025-01-10 00:51:04,874 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 33 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2025-01-10 00:51:04,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 193 flow [2025-01-10 00:51:04,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:51:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:51:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-01-10 00:51:04,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2025-01-10 00:51:04,890 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 89 flow. Second operand 3 states and 96 transitions. [2025-01-10 00:51:04,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 193 flow [2025-01-10 00:51:04,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:51:04,895 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2025-01-10 00:51:04,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-01-10 00:51:04,898 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2025-01-10 00:51:04,898 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2025-01-10 00:51:04,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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-01-10 00:51:04,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:04,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:04,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:51:05,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:05,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:51:05,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:05,104 INFO L85 PathProgramCache]: Analyzing trace with hash 534475217, now seen corresponding path program 1 times [2025-01-10 00:51:05,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:05,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345675769] [2025-01-10 00:51:05,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:05,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:05,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:05,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:51:05,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:51:05,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:51:05,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:51:05,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:05,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:05,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:51:05,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:05,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:05,229 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:05,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345675769] [2025-01-10 00:51:05,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345675769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:05,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:05,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:51:05,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938154172] [2025-01-10 00:51:05,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:05,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:51:05,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:05,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:51:05,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:51:05,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-01-10 00:51:05,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:05,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:05,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-01-10 00:51:05,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:05,378 INFO L124 PetriNetUnfolderBase]: 605/1133 cut-off events. [2025-01-10 00:51:05,379 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-01-10 00:51:05,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 1133 events. 605/1133 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6932 event pairs, 605 based on Foata normal form. 36/1130 useless extension candidates. Maximal degree in co-relation 2167. Up to 926 conditions per place. [2025-01-10 00:51:05,384 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 18 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2025-01-10 00:51:05,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 118 flow [2025-01-10 00:51:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:51:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:51:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-01-10 00:51:05,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2025-01-10 00:51:05,385 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 3 states and 72 transitions. [2025-01-10 00:51:05,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 118 flow [2025-01-10 00:51:05,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:51:05,386 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2025-01-10 00:51:05,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-01-10 00:51:05,387 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2025-01-10 00:51:05,387 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2025-01-10 00:51:05,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:05,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:05,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:05,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:51:05,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:05,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:51:05,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:05,588 INFO L85 PathProgramCache]: Analyzing trace with hash 534476613, now seen corresponding path program 1 times [2025-01-10 00:51:05,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:05,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2067821616] [2025-01-10 00:51:05,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:05,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:05,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:05,592 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:51:05,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:51:05,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:51:05,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:51:05,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:05,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:05,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:51:05,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:05,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:05,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:05,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067821616] [2025-01-10 00:51:05,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067821616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:05,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:05,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:51:05,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880505822] [2025-01-10 00:51:05,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:05,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:51:05,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:05,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:51:05,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:51:05,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-10 00:51:05,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:05,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:05,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-10 00:51:05,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:06,040 INFO L124 PetriNetUnfolderBase]: 1363/2292 cut-off events. [2025-01-10 00:51:06,040 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:51:06,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4410 conditions, 2292 events. 1363/2292 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13567 event pairs, 149 based on Foata normal form. 80/2339 useless extension candidates. Maximal degree in co-relation 4404. Up to 1297 conditions per place. [2025-01-10 00:51:06,050 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 40 selfloop transitions, 5 changer transitions 1/56 dead transitions. [2025-01-10 00:51:06,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 216 flow [2025-01-10 00:51:06,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:51:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:51:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-01-10 00:51:06,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2025-01-10 00:51:06,052 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 4 states and 104 transitions. [2025-01-10 00:51:06,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 216 flow [2025-01-10 00:51:06,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:51:06,054 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 107 flow [2025-01-10 00:51:06,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-01-10 00:51:06,054 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2025-01-10 00:51:06,054 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 107 flow [2025-01-10 00:51:06,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:06,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:06,055 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:06,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:51:06,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:06,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:51:06,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:06,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1440188269, now seen corresponding path program 1 times [2025-01-10 00:51:06,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:06,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547796634] [2025-01-10 00:51:06,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:06,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:06,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:06,264 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:51:06,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:51:06,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:51:06,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:51:06,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:06,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:06,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:51:06,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:06,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:06,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:06,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547796634] [2025-01-10 00:51:06,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547796634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:06,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:06,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:51:06,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566388865] [2025-01-10 00:51:06,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:06,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:51:06,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:06,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:51:06,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:51:06,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-10 00:51:06,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:06,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:06,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-10 00:51:06,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:06,627 INFO L124 PetriNetUnfolderBase]: 879/1508 cut-off events. [2025-01-10 00:51:06,627 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-01-10 00:51:06,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3437 conditions, 1508 events. 879/1508 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7898 event pairs, 75 based on Foata normal form. 68/1550 useless extension candidates. Maximal degree in co-relation 3428. Up to 625 conditions per place. [2025-01-10 00:51:06,636 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 50 selfloop transitions, 8 changer transitions 1/69 dead transitions. [2025-01-10 00:51:06,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 69 transitions, 312 flow [2025-01-10 00:51:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:51:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:51:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-01-10 00:51:06,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6093023255813953 [2025-01-10 00:51:06,640 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 107 flow. Second operand 5 states and 131 transitions. [2025-01-10 00:51:06,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 69 transitions, 312 flow [2025-01-10 00:51:06,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 302 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:51:06,642 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 147 flow [2025-01-10 00:51:06,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2025-01-10 00:51:06,643 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2025-01-10 00:51:06,643 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 147 flow [2025-01-10 00:51:06,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:06,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:06,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:06,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 00:51:06,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:06,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:51:06,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:06,849 INFO L85 PathProgramCache]: Analyzing trace with hash 972855942, now seen corresponding path program 1 times [2025-01-10 00:51:06,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:06,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [705084463] [2025-01-10 00:51:06,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:06,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:06,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:06,853 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:51:06,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:51:06,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:51:06,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:51:06,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:06,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:06,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:51:06,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:06,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:06,982 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:06,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705084463] [2025-01-10 00:51:06,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705084463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:06,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:06,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:51:06,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533616788] [2025-01-10 00:51:06,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:06,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:51:06,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:06,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:51:06,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:51:06,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-10 00:51:06,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:06,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:06,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-10 00:51:06,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:07,201 INFO L124 PetriNetUnfolderBase]: 491/836 cut-off events. [2025-01-10 00:51:07,201 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2025-01-10 00:51:07,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 836 events. 491/836 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3598 event pairs, 61 based on Foata normal form. 36/846 useless extension candidates. Maximal degree in co-relation 2164. Up to 268 conditions per place. [2025-01-10 00:51:07,205 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 44 selfloop transitions, 11 changer transitions 1/66 dead transitions. [2025-01-10 00:51:07,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 323 flow [2025-01-10 00:51:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:51:07,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:51:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-01-10 00:51:07,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5503875968992248 [2025-01-10 00:51:07,207 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 147 flow. Second operand 6 states and 142 transitions. [2025-01-10 00:51:07,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 323 flow [2025-01-10 00:51:07,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 298 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 00:51:07,210 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 161 flow [2025-01-10 00:51:07,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-01-10 00:51:07,211 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2025-01-10 00:51:07,211 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 161 flow [2025-01-10 00:51:07,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:07,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:07,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:07,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 00:51:07,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:07,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:51:07,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1607408755, now seen corresponding path program 1 times [2025-01-10 00:51:07,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:07,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [724809942] [2025-01-10 00:51:07,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:51:07,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:07,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:07,421 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:51:07,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:51:07,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:51:07,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:51:07,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:07,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:07,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 00:51:07,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:07,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:07,804 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:07,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724809942] [2025-01-10 00:51:07,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724809942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:07,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:07,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:51:07,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782208223] [2025-01-10 00:51:07,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:07,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:51:07,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:07,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:51:07,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:51:07,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2025-01-10 00:51:07,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 161 flow. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:07,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:07,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2025-01-10 00:51:07,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:07,996 INFO L124 PetriNetUnfolderBase]: 504/957 cut-off events. [2025-01-10 00:51:07,996 INFO L125 PetriNetUnfolderBase]: For 384/403 co-relation queries the response was YES. [2025-01-10 00:51:07,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2207 conditions, 957 events. 504/957 cut-off events. For 384/403 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4829 event pairs, 232 based on Foata normal form. 8/901 useless extension candidates. Maximal degree in co-relation 2195. Up to 483 conditions per place. [2025-01-10 00:51:08,000 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 25 selfloop transitions, 4 changer transitions 14/61 dead transitions. [2025-01-10 00:51:08,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 303 flow [2025-01-10 00:51:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:51:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:51:08,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2025-01-10 00:51:08,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5182724252491694 [2025-01-10 00:51:08,001 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 161 flow. Second operand 7 states and 156 transitions. [2025-01-10 00:51:08,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 303 flow [2025-01-10 00:51:08,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 236 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-01-10 00:51:08,004 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 132 flow [2025-01-10 00:51:08,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=132, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2025-01-10 00:51:08,004 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2025-01-10 00:51:08,004 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 132 flow [2025-01-10 00:51:08,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:08,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:08,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:08,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:51:08,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:08,205 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:51:08,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2021282583, now seen corresponding path program 2 times [2025-01-10 00:51:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:08,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [85609399] [2025-01-10 00:51:08,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:51:08,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:08,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:08,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:51:08,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:51:08,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:51:08,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:51:08,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:51:08,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:08,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 00:51:08,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:08,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:08,447 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:08,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85609399] [2025-01-10 00:51:08,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85609399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:08,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:08,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:51:08,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562692310] [2025-01-10 00:51:08,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:08,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:51:08,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:08,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:51:08,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:51:08,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-10 00:51:08,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 132 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:08,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:08,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-10 00:51:08,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:08,856 INFO L124 PetriNetUnfolderBase]: 1737/3173 cut-off events. [2025-01-10 00:51:08,856 INFO L125 PetriNetUnfolderBase]: For 415/421 co-relation queries the response was YES. [2025-01-10 00:51:08,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7076 conditions, 3173 events. 1737/3173 cut-off events. For 415/421 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 20984 event pairs, 538 based on Foata normal form. 28/3080 useless extension candidates. Maximal degree in co-relation 7064. Up to 882 conditions per place. [2025-01-10 00:51:08,865 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 33 selfloop transitions, 2 changer transitions 63/114 dead transitions. [2025-01-10 00:51:08,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 114 transitions, 529 flow [2025-01-10 00:51:08,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:51:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:51:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 275 transitions. [2025-01-10 00:51:08,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4919499105545617 [2025-01-10 00:51:08,866 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 132 flow. Second operand 13 states and 275 transitions. [2025-01-10 00:51:08,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 114 transitions, 529 flow [2025-01-10 00:51:08,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 114 transitions, 500 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-10 00:51:08,869 INFO L231 Difference]: Finished difference. Result has 70 places, 41 transitions, 151 flow [2025-01-10 00:51:08,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=151, PETRI_PLACES=70, PETRI_TRANSITIONS=41} [2025-01-10 00:51:08,869 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2025-01-10 00:51:08,869 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 41 transitions, 151 flow [2025-01-10 00:51:08,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:08,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:08,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:08,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:51:09,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:09,070 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:51:09,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:09,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1534375457, now seen corresponding path program 3 times [2025-01-10 00:51:09,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:09,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219058086] [2025-01-10 00:51:09,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:51:09,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:09,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:09,078 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:51:09,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:51:09,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:51:09,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:51:09,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:51:09,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:09,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 00:51:09,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:09,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:09,444 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:09,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219058086] [2025-01-10 00:51:09,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219058086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:09,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:09,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:51:09,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005567077] [2025-01-10 00:51:09,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:09,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:51:09,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:09,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:51:09,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:51:09,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2025-01-10 00:51:09,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 41 transitions, 151 flow. Second operand has 10 states, 10 states have (on average 17.8) internal successors, (178), 10 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:09,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:09,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2025-01-10 00:51:09,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:09,696 INFO L124 PetriNetUnfolderBase]: 561/1068 cut-off events. [2025-01-10 00:51:09,696 INFO L125 PetriNetUnfolderBase]: For 447/465 co-relation queries the response was YES. [2025-01-10 00:51:09,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2461 conditions, 1068 events. 561/1068 cut-off events. For 447/465 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5681 event pairs, 256 based on Foata normal form. 10/1012 useless extension candidates. Maximal degree in co-relation 2442. Up to 417 conditions per place. [2025-01-10 00:51:09,701 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 25 selfloop transitions, 4 changer transitions 15/62 dead transitions. [2025-01-10 00:51:09,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 302 flow [2025-01-10 00:51:09,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:51:09,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:51:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2025-01-10 00:51:09,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5182724252491694 [2025-01-10 00:51:09,707 INFO L175 Difference]: Start difference. First operand has 70 places, 41 transitions, 151 flow. Second operand 7 states and 156 transitions. [2025-01-10 00:51:09,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 302 flow [2025-01-10 00:51:09,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 262 flow, removed 19 selfloop flow, removed 11 redundant places. [2025-01-10 00:51:09,711 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 152 flow [2025-01-10 00:51:09,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2025-01-10 00:51:09,712 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2025-01-10 00:51:09,713 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 152 flow [2025-01-10 00:51:09,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.8) internal successors, (178), 10 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:09,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:09,714 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:09,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 00:51:09,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:09,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:51:09,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash -345086843, now seen corresponding path program 4 times [2025-01-10 00:51:09,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:09,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [13251894] [2025-01-10 00:51:09,919 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:51:09,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:09,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:09,921 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:51:09,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 00:51:09,990 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-01-10 00:51:10,008 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:51:10,008 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:51:10,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:51:10,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 00:51:10,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:51:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:51:10,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:51:10,132 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:51:10,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13251894] [2025-01-10 00:51:10,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13251894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:51:10,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:51:10,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:51:10,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205666802] [2025-01-10 00:51:10,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:51:10,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:51:10,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:51:10,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:51:10,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:51:10,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-10 00:51:10,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 152 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:10,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:51:10,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-10 00:51:10,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:51:10,358 INFO L124 PetriNetUnfolderBase]: 903/1731 cut-off events. [2025-01-10 00:51:10,358 INFO L125 PetriNetUnfolderBase]: For 546/554 co-relation queries the response was YES. [2025-01-10 00:51:10,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4041 conditions, 1731 events. 903/1731 cut-off events. For 546/554 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 10338 event pairs, 359 based on Foata normal form. 15/1683 useless extension candidates. Maximal degree in co-relation 4027. Up to 704 conditions per place. [2025-01-10 00:51:10,363 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 30 selfloop transitions, 3 changer transitions 22/71 dead transitions. [2025-01-10 00:51:10,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 353 flow [2025-01-10 00:51:10,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:51:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:51:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2025-01-10 00:51:10,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2025-01-10 00:51:10,365 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 152 flow. Second operand 6 states and 134 transitions. [2025-01-10 00:51:10,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 353 flow [2025-01-10 00:51:10,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 336 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-01-10 00:51:10,367 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 149 flow [2025-01-10 00:51:10,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2025-01-10 00:51:10,367 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2025-01-10 00:51:10,367 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 149 flow [2025-01-10 00:51:10,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:51:10,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:51:10,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:51:10,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 00:51:10,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:10,573 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:51:10,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:51:10,574 INFO L85 PathProgramCache]: Analyzing trace with hash -420122107, now seen corresponding path program 5 times [2025-01-10 00:51:10,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:51:10,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [937921759] [2025-01-10 00:51:10,574 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:51:10,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:10,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:51:10,577 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:51:10,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 00:51:10,623 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:51:10,638 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:51:10,638 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:51:10,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:51:10,638 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:51:10,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:51:10,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:51:10,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:51:10,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:51:10,691 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:51:10,691 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:51:10,691 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-01-10 00:51:10,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 00:51:10,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-01-10 00:51:10,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-10 00:51:10,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-01-10 00:51:10,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-01-10 00:51:10,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:51:10,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 00:51:10,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:51:10,893 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2025-01-10 00:51:10,956 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:51:10,956 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:51:10,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:51:10 BasicIcfg [2025-01-10 00:51:10,959 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:51:10,960 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:51:10,960 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:51:10,960 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:51:10,960 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:04" (3/4) ... [2025-01-10 00:51:10,962 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:51:10,962 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:51:10,963 INFO L158 Benchmark]: Toolchain (without parser) took 8214.82ms. Allocated memory was 83.9MB in the beginning and 209.7MB in the end (delta: 125.8MB). Free memory was 58.3MB in the beginning and 132.4MB in the end (delta: -74.1MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2025-01-10 00:51:10,963 INFO L158 Benchmark]: CDTParser took 2.31ms. Allocated memory is still 83.9MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:51:10,963 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.34ms. Allocated memory is still 83.9MB. Free memory was 58.3MB in the beginning and 34.9MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:51:10,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.18ms. Allocated memory is still 83.9MB. Free memory was 34.9MB in the beginning and 32.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:51:10,963 INFO L158 Benchmark]: Boogie Preprocessor took 40.26ms. Allocated memory is still 83.9MB. Free memory was 32.6MB in the beginning and 29.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:51:10,964 INFO L158 Benchmark]: RCFGBuilder took 664.61ms. Allocated memory is still 83.9MB. Free memory was 29.6MB in the beginning and 32.1MB in the end (delta: -2.6MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2025-01-10 00:51:10,964 INFO L158 Benchmark]: TraceAbstraction took 6864.31ms. Allocated memory was 83.9MB in the beginning and 209.7MB in the end (delta: 125.8MB). Free memory was 31.6MB in the beginning and 132.4MB in the end (delta: -100.8MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2025-01-10 00:51:10,964 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 209.7MB. Free memory was 132.4MB in the beginning and 132.4MB in the end (delta: 11.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:51:10,965 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.31ms. Allocated memory is still 83.9MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.34ms. Allocated memory is still 83.9MB. Free memory was 58.3MB in the beginning and 34.9MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.18ms. Allocated memory is still 83.9MB. Free memory was 34.9MB in the beginning and 32.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.26ms. Allocated memory is still 83.9MB. Free memory was 32.6MB in the beginning and 29.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 664.61ms. Allocated memory is still 83.9MB. Free memory was 29.6MB in the beginning and 32.1MB in the end (delta: -2.6MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6864.31ms. Allocated memory was 83.9MB in the beginning and 209.7MB in the end (delta: 125.8MB). Free memory was 31.6MB in the beginning and 132.4MB in the end (delta: -100.8MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 209.7MB. Free memory was 132.4MB in the beginning and 132.4MB in the end (delta: 11.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-1, t2178=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-1, t2178=0, t2179=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 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) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-1, t2178=0, t2179=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-1, t2178=0, t2179=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-1, t2178=0, t2179=1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 394 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 150 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1121 IncrementalHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 12 mSDtfsCounter, 1121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=5, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 1014 SizeOfPredicates, 27 NumberOfNonLiveVariables, 956 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 00:51:10,978 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