./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe024_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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 0917507184a262ba6442de2995b8b922c1a1388e63695c7a63bfd1ed6f65ad74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:09:59,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:09:59,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:09:59,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:09:59,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:09:59,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:09:59,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:09:59,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:09:59,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:09:59,464 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:09:59,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:09:59,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:09:59,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:09:59,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:09:59,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:09:59,465 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:09:59,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:09:59,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:09:59,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:09:59,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:09:59,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:09:59,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:09:59,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:09:59,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:09:59,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:09:59,466 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/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 -> 0917507184a262ba6442de2995b8b922c1a1388e63695c7a63bfd1ed6f65ad74 [2025-03-09 01:09:59,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:09:59,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:09:59,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:09:59,689 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:09:59,689 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:09:59,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-09 01:10:00,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c672c138d/680f53dda08747f8831f33153c11e24f/FLAGdff48bab0 [2025-03-09 01:10:01,154 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:10:01,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-09 01:10:01,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c672c138d/680f53dda08747f8831f33153c11e24f/FLAGdff48bab0 [2025-03-09 01:10:01,416 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c672c138d/680f53dda08747f8831f33153c11e24f [2025-03-09 01:10:01,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:10:01,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:10:01,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:10:01,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:10:01,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:10:01,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:10:01" (1/1) ... [2025-03-09 01:10:01,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64130695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01, skipping insertion in model container [2025-03-09 01:10:01,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:10:01" (1/1) ... [2025-03-09 01:10:01,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:10:01,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:10:01,667 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:10:01,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:10:01,757 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:10:01,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01 WrapperNode [2025-03-09 01:10:01,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:10:01,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:10:01,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:10:01,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:10:01,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01" (1/1) ... [2025-03-09 01:10:01,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01" (1/1) ... [2025-03-09 01:10:01,795 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2025-03-09 01:10:01,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:10:01,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:10:01,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:10:01,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:10:01,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01" (1/1) ... [2025-03-09 01:10:01,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01" (1/1) ... [2025-03-09 01:10:01,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01" (1/1) ... [2025-03-09 01:10:01,830 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-03-09 01:10:01,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01" (1/1) ... [2025-03-09 01:10:01,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01" (1/1) ... [2025-03-09 01:10:01,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01" (1/1) ... [2025-03-09 01:10:01,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01" (1/1) ... [2025-03-09 01:10:01,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01" (1/1) ... [2025-03-09 01:10:01,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01" (1/1) ... [2025-03-09 01:10:01,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:10:01,853 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:10:01,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:10:01,853 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:10:01,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01" (1/1) ... [2025-03-09 01:10:01,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:10:01,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:10:01,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:10:01,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:10:01,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:10:01,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:10:01,901 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-09 01:10:01,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-09 01:10:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-09 01:10:01,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-09 01:10:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-09 01:10:01,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-09 01:10:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:10:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:10:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:10:01,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:10:01,903 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:10:02,016 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:10:02,018 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:10:02,255 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:10:02,256 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:10:02,434 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:10:02,435 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:10:02,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:10:02 BoogieIcfgContainer [2025-03-09 01:10:02,435 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:10:02,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:10:02,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:10:02,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:10:02,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:10:01" (1/3) ... [2025-03-09 01:10:02,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d061c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:10:02, skipping insertion in model container [2025-03-09 01:10:02,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:01" (2/3) ... [2025-03-09 01:10:02,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d061c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:10:02, skipping insertion in model container [2025-03-09 01:10:02,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:10:02" (3/3) ... [2025-03-09 01:10:02,444 INFO L128 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-09 01:10:02,454 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:10:02,456 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-09 01:10:02,456 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:10:02,503 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:10:02,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2025-03-09 01:10:02,556 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2025-03-09 01:10:02,558 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:10:02,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-03-09 01:10:02,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2025-03-09 01:10:02,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2025-03-09 01:10:02,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:10:02,584 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;@1270bd5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:10:02,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-09 01:10:02,590 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:10:02,591 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-09 01:10:02,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:10:02,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:02,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:10:02,592 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:02,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1807300723, now seen corresponding path program 1 times [2025-03-09 01:10:02,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:10:02,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700220963] [2025-03-09 01:10:02,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:10:02,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:10:02,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:10:02,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:02,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:02,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:10:02,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700220963] [2025-03-09 01:10:02,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700220963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:02,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:02,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:10:02,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820506574] [2025-03-09 01:10:02,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:02,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:10:02,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:10:02,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:10:02,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:10:02,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-09 01:10:02,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-09 01:10:02,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:02,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-09 01:10:02,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:03,852 INFO L124 PetriNetUnfolderBase]: 6263/9043 cut-off events. [2025-03-09 01:10:03,853 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-09 01:10:03,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18030 conditions, 9043 events. 6263/9043 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 50857 event pairs, 693 based on Foata normal form. 504/9532 useless extension candidates. Maximal degree in co-relation 18019. Up to 7741 conditions per place. [2025-03-09 01:10:03,892 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-03-09 01:10:03,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 238 flow [2025-03-09 01:10:03,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:10:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:10:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-03-09 01:10:03,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2025-03-09 01:10:03,907 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 88 transitions. [2025-03-09 01:10:03,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 238 flow [2025-03-09 01:10:03,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:10:03,914 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2025-03-09 01:10:03,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-03-09 01:10:03,918 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-03-09 01:10:03,920 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2025-03-09 01:10:03,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-09 01:10:03,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:03,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:10:03,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:10:03,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:03,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:03,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1962043297, now seen corresponding path program 1 times [2025-03-09 01:10:03,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:10:03,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929883186] [2025-03-09 01:10:03,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:03,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:10:03,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:10:03,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:10:03,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:03,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:03,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:10:03,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929883186] [2025-03-09 01:10:03,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929883186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:03,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:03,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:10:03,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244630081] [2025-03-09 01:10:03,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:03,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:10:03,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:10:03,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:10:03,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:10:03,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-09 01:10:03,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:03,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:03,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-09 01:10:03,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:04,512 INFO L124 PetriNetUnfolderBase]: 5627/8719 cut-off events. [2025-03-09 01:10:04,512 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-03-09 01:10:04,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17209 conditions, 8719 events. 5627/8719 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 52134 event pairs, 5627 based on Foata normal form. 252/8916 useless extension candidates. Maximal degree in co-relation 17199. Up to 7994 conditions per place. [2025-03-09 01:10:04,551 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 28 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2025-03-09 01:10:04,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 142 flow [2025-03-09 01:10:04,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:10:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:10:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-09 01:10:04,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2025-03-09 01:10:04,552 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 58 transitions. [2025-03-09 01:10:04,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 142 flow [2025-03-09 01:10:04,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:10:04,553 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2025-03-09 01:10:04,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-03-09 01:10:04,553 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-03-09 01:10:04,554 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2025-03-09 01:10:04,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:04,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:04,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:10:04,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:10:04,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:04,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:04,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1962042859, now seen corresponding path program 1 times [2025-03-09 01:10:04,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:10:04,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268010803] [2025-03-09 01:10:04,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:04,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:10:04,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:10:04,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:10:04,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:04,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:04,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:10:04,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268010803] [2025-03-09 01:10:04,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268010803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:04,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:04,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:10:04,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539659505] [2025-03-09 01:10:04,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:04,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:10:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:10:04,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:10:04,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:10:04,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-09 01:10:04,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:04,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:04,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-09 01:10:04,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:05,632 INFO L124 PetriNetUnfolderBase]: 6873/10259 cut-off events. [2025-03-09 01:10:05,632 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:10:05,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20191 conditions, 10259 events. 6873/10259 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 59198 event pairs, 972 based on Foata normal form. 0/10036 useless extension candidates. Maximal degree in co-relation 20185. Up to 5865 conditions per place. [2025-03-09 01:10:05,664 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 42 selfloop transitions, 2 changer transitions 75/124 dead transitions. [2025-03-09 01:10:05,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 124 transitions, 494 flow [2025-03-09 01:10:05,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:10:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:10:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2025-03-09 01:10:05,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5361111111111111 [2025-03-09 01:10:05,666 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 8 states and 193 transitions. [2025-03-09 01:10:05,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 124 transitions, 494 flow [2025-03-09 01:10:05,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:10:05,672 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 91 flow [2025-03-09 01:10:05,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=91, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2025-03-09 01:10:05,673 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-03-09 01:10:05,673 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 91 flow [2025-03-09 01:10:05,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:05,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:05,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:10:05,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:10:05,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:05,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:05,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1458859030, now seen corresponding path program 1 times [2025-03-09 01:10:05,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:10:05,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206974839] [2025-03-09 01:10:05,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:05,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:10:05,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:10:05,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:10:05,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:05,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:05,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:10:05,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206974839] [2025-03-09 01:10:05,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206974839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:05,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:05,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:10:05,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145953312] [2025-03-09 01:10:05,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:05,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:10:05,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:10:05,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:10:05,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:10:05,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-09 01:10:05,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 34 transitions, 91 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:05,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:05,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-09 01:10:05,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:06,600 INFO L124 PetriNetUnfolderBase]: 6015/9019 cut-off events. [2025-03-09 01:10:06,601 INFO L125 PetriNetUnfolderBase]: For 1802/1802 co-relation queries the response was YES. [2025-03-09 01:10:06,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19713 conditions, 9019 events. 6015/9019 cut-off events. For 1802/1802 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 51201 event pairs, 771 based on Foata normal form. 234/9244 useless extension candidates. Maximal degree in co-relation 19701. Up to 4553 conditions per place. [2025-03-09 01:10:06,640 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 75 selfloop transitions, 9 changer transitions 94/183 dead transitions. [2025-03-09 01:10:06,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 183 transitions, 792 flow [2025-03-09 01:10:06,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:10:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:10:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 299 transitions. [2025-03-09 01:10:06,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2025-03-09 01:10:06,643 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 91 flow. Second operand 13 states and 299 transitions. [2025-03-09 01:10:06,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 183 transitions, 792 flow [2025-03-09 01:10:06,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 183 transitions, 750 flow, removed 16 selfloop flow, removed 6 redundant places. [2025-03-09 01:10:06,720 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 174 flow [2025-03-09 01:10:06,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=174, PETRI_PLACES=66, PETRI_TRANSITIONS=41} [2025-03-09 01:10:06,721 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2025-03-09 01:10:06,721 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 174 flow [2025-03-09 01:10:06,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:06,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:06,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:10:06,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:10:06,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:06,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:06,722 INFO L85 PathProgramCache]: Analyzing trace with hash -85654826, now seen corresponding path program 1 times [2025-03-09 01:10:06,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:10:06,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034058040] [2025-03-09 01:10:06,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:06,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:10:06,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:10:06,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:10:06,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:06,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:06,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:10:06,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034058040] [2025-03-09 01:10:06,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034058040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:06,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:06,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:10:06,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538921356] [2025-03-09 01:10:06,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:06,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:10:06,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:10:06,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:10:06,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:10:06,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-09 01:10:06,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 41 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:06,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:06,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-09 01:10:06,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:07,551 INFO L124 PetriNetUnfolderBase]: 6869/10143 cut-off events. [2025-03-09 01:10:07,552 INFO L125 PetriNetUnfolderBase]: For 16991/16991 co-relation queries the response was YES. [2025-03-09 01:10:07,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29130 conditions, 10143 events. 6869/10143 cut-off events. For 16991/16991 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 56042 event pairs, 1645 based on Foata normal form. 192/10322 useless extension candidates. Maximal degree in co-relation 29111. Up to 3817 conditions per place. [2025-03-09 01:10:07,592 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 51 selfloop transitions, 5 changer transitions 68/129 dead transitions. [2025-03-09 01:10:07,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 129 transitions, 783 flow [2025-03-09 01:10:07,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:10:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:10:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2025-03-09 01:10:07,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5305555555555556 [2025-03-09 01:10:07,596 INFO L175 Difference]: Start difference. First operand has 66 places, 41 transitions, 174 flow. Second operand 8 states and 191 transitions. [2025-03-09 01:10:07,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 129 transitions, 783 flow [2025-03-09 01:10:07,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 129 transitions, 696 flow, removed 40 selfloop flow, removed 7 redundant places. [2025-03-09 01:10:07,659 INFO L231 Difference]: Finished difference. Result has 64 places, 38 transitions, 161 flow [2025-03-09 01:10:07,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=161, PETRI_PLACES=64, PETRI_TRANSITIONS=38} [2025-03-09 01:10:07,660 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2025-03-09 01:10:07,660 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 38 transitions, 161 flow [2025-03-09 01:10:07,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:07,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:07,660 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-03-09 01:10:07,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:10:07,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:07,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:07,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1553824420, now seen corresponding path program 1 times [2025-03-09 01:10:07,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:10:07,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245089935] [2025-03-09 01:10:07,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:07,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:10:07,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:10:07,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:10:07,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:07,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:07,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:10:07,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245089935] [2025-03-09 01:10:07,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245089935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:07,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:07,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:10:07,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57455496] [2025-03-09 01:10:07,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:07,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:10:07,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:10:07,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:10:07,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:10:07,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-09 01:10:07,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 38 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-03-09 01:10:07,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:07,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-09 01:10:07,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:08,147 INFO L124 PetriNetUnfolderBase]: 2778/4380 cut-off events. [2025-03-09 01:10:08,148 INFO L125 PetriNetUnfolderBase]: For 5306/5306 co-relation queries the response was YES. [2025-03-09 01:10:08,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12025 conditions, 4380 events. 2778/4380 cut-off events. For 5306/5306 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23234 event pairs, 399 based on Foata normal form. 182/4559 useless extension candidates. Maximal degree in co-relation 12005. Up to 2356 conditions per place. [2025-03-09 01:10:08,167 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 66 selfloop transitions, 5 changer transitions 1/77 dead transitions. [2025-03-09 01:10:08,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 463 flow [2025-03-09 01:10:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:10:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:10:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-09 01:10:08,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-03-09 01:10:08,171 INFO L175 Difference]: Start difference. First operand has 64 places, 38 transitions, 161 flow. Second operand 4 states and 106 transitions. [2025-03-09 01:10:08,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 463 flow [2025-03-09 01:10:08,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 414 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-03-09 01:10:08,183 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 166 flow [2025-03-09 01:10:08,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2025-03-09 01:10:08,184 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2025-03-09 01:10:08,185 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 166 flow [2025-03-09 01:10:08,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-03-09 01:10:08,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:08,185 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-03-09 01:10:08,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:10:08,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:08,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:08,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1564933405, now seen corresponding path program 1 times [2025-03-09 01:10:08,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:10:08,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902311447] [2025-03-09 01:10:08,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:08,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:10:08,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:10:08,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:10:08,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:08,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:08,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:10:08,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902311447] [2025-03-09 01:10:08,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902311447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:08,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:08,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:10:08,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666799695] [2025-03-09 01:10:08,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:08,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:10:08,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:10:08,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:10:08,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:10:08,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-09 01:10:08,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:08,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:08,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-09 01:10:08,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:08,673 INFO L124 PetriNetUnfolderBase]: 1665/2667 cut-off events. [2025-03-09 01:10:08,673 INFO L125 PetriNetUnfolderBase]: For 2488/2488 co-relation queries the response was YES. [2025-03-09 01:10:08,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7364 conditions, 2667 events. 1665/2667 cut-off events. For 2488/2488 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 12620 event pairs, 253 based on Foata normal form. 132/2796 useless extension candidates. Maximal degree in co-relation 7349. Up to 877 conditions per place. [2025-03-09 01:10:08,684 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 76 selfloop transitions, 8 changer transitions 1/90 dead transitions. [2025-03-09 01:10:08,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 90 transitions, 523 flow [2025-03-09 01:10:08,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:10:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:10:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-09 01:10:08,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822222222222222 [2025-03-09 01:10:08,685 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 166 flow. Second operand 5 states and 131 transitions. [2025-03-09 01:10:08,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 90 transitions, 523 flow [2025-03-09 01:10:08,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 513 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:10:08,689 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 206 flow [2025-03-09 01:10:08,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2025-03-09 01:10:08,690 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2025-03-09 01:10:08,690 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 206 flow [2025-03-09 01:10:08,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:08,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:08,690 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] [2025-03-09 01:10:08,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:10:08,690 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:08,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:08,691 INFO L85 PathProgramCache]: Analyzing trace with hash 765305148, now seen corresponding path program 1 times [2025-03-09 01:10:08,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:10:08,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159317679] [2025-03-09 01:10:08,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:08,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:10:08,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:10:08,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:10:08,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:08,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:08,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:10:08,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159317679] [2025-03-09 01:10:08,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159317679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:08,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:08,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:10:08,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745807544] [2025-03-09 01:10:08,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:08,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:10:08,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:10:08,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:10:08,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:10:08,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-09 01:10:08,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-03-09 01:10:08,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:08,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-09 01:10:08,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:09,129 INFO L124 PetriNetUnfolderBase]: 1009/1599 cut-off events. [2025-03-09 01:10:09,129 INFO L125 PetriNetUnfolderBase]: For 2142/2142 co-relation queries the response was YES. [2025-03-09 01:10:09,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4738 conditions, 1599 events. 1009/1599 cut-off events. For 2142/2142 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6741 event pairs, 223 based on Foata normal form. 52/1648 useless extension candidates. Maximal degree in co-relation 4721. Up to 572 conditions per place. [2025-03-09 01:10:09,141 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 66 selfloop transitions, 11 changer transitions 1/83 dead transitions. [2025-03-09 01:10:09,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 498 flow [2025-03-09 01:10:09,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:10:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:10:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2025-03-09 01:10:09,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2025-03-09 01:10:09,143 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 206 flow. Second operand 6 states and 134 transitions. [2025-03-09 01:10:09,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 498 flow [2025-03-09 01:10:09,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 457 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-09 01:10:09,150 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 207 flow [2025-03-09 01:10:09,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2025-03-09 01:10:09,150 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2025-03-09 01:10:09,152 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 207 flow [2025-03-09 01:10:09,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-03-09 01:10:09,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:09,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:10:09,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:10:09,152 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:09,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1176914269, now seen corresponding path program 1 times [2025-03-09 01:10:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:10:09,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672403128] [2025-03-09 01:10:09,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:09,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:10:09,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:10:09,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:10:09,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:09,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:09,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:10:09,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672403128] [2025-03-09 01:10:09,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672403128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:09,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:09,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:10:09,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792778483] [2025-03-09 01:10:09,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:09,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:10:09,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:10:09,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:10:09,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:10:09,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-09 01:10:09,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:09,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:09,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-09 01:10:09,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:09,660 INFO L124 PetriNetUnfolderBase]: 1329/2092 cut-off events. [2025-03-09 01:10:09,660 INFO L125 PetriNetUnfolderBase]: For 2770/2770 co-relation queries the response was YES. [2025-03-09 01:10:09,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6123 conditions, 2092 events. 1329/2092 cut-off events. For 2770/2770 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9128 event pairs, 261 based on Foata normal form. 8/2099 useless extension candidates. Maximal degree in co-relation 6106. Up to 1248 conditions per place. [2025-03-09 01:10:09,667 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 43 selfloop transitions, 1 changer transitions 41/90 dead transitions. [2025-03-09 01:10:09,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 593 flow [2025-03-09 01:10:09,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:10:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:10:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2025-03-09 01:10:09,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2025-03-09 01:10:09,668 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 207 flow. Second operand 6 states and 122 transitions. [2025-03-09 01:10:09,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 593 flow [2025-03-09 01:10:09,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 90 transitions, 452 flow, removed 28 selfloop flow, removed 10 redundant places. [2025-03-09 01:10:09,674 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 136 flow [2025-03-09 01:10:09,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2025-03-09 01:10:09,675 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-03-09 01:10:09,675 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 136 flow [2025-03-09 01:10:09,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:09,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:09,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:10:09,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:10:09,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:09,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:09,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1256645637, now seen corresponding path program 2 times [2025-03-09 01:10:09,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:10:09,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921984648] [2025-03-09 01:10:09,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:10:09,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:10:09,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:10:09,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:10:09,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:10:09,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:10,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:10:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921984648] [2025-03-09 01:10:10,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921984648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:10,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:10,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:10:10,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854602785] [2025-03-09 01:10:10,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:10,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:10:10,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:10:10,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:10:10,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:10:10,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-09 01:10:10,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 136 flow. Second operand has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 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-03-09 01:10:10,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:10,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-09 01:10:10,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:10,758 INFO L124 PetriNetUnfolderBase]: 919/1508 cut-off events. [2025-03-09 01:10:10,758 INFO L125 PetriNetUnfolderBase]: For 528/528 co-relation queries the response was YES. [2025-03-09 01:10:10,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3592 conditions, 1508 events. 919/1508 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6315 event pairs, 240 based on Foata normal form. 8/1513 useless extension candidates. Maximal degree in co-relation 3578. Up to 575 conditions per place. [2025-03-09 01:10:10,760 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 38 selfloop transitions, 3 changer transitions 47/93 dead transitions. [2025-03-09 01:10:10,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 474 flow [2025-03-09 01:10:10,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:10:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:10:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2025-03-09 01:10:10,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3851851851851852 [2025-03-09 01:10:10,761 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 136 flow. Second operand 9 states and 156 transitions. [2025-03-09 01:10:10,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 474 flow [2025-03-09 01:10:10,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 456 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-09 01:10:10,763 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 143 flow [2025-03-09 01:10:10,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=143, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2025-03-09 01:10:10,763 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2025-03-09 01:10:10,763 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 143 flow [2025-03-09 01:10:10,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 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-03-09 01:10:10,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:10,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:10:10,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:10:10,764 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:10,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:10,764 INFO L85 PathProgramCache]: Analyzing trace with hash -28257797, now seen corresponding path program 3 times [2025-03-09 01:10:10,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:10:10,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512156216] [2025-03-09 01:10:10,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:10:10,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:10:10,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:10:10,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:10:10,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:10:10,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:10:10,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:10:10,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:10:10,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:10:10,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:10,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:10:10,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:10:10,875 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:10:10,876 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-09 01:10:10,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-09 01:10:10,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-09 01:10:10,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-09 01:10:10,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-09 01:10:10,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-09 01:10:10,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-09 01:10:10,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:10:10,882 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:10:10,936 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:10:10,936 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:10:10,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:10:10 BasicIcfg [2025-03-09 01:10:10,941 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:10:10,942 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:10:10,942 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:10:10,942 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:10:10,942 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:10:02" (3/4) ... [2025-03-09 01:10:10,943 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 01:10:10,944 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:10:10,944 INFO L158 Benchmark]: Toolchain (without parser) took 9525.29ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 106.0MB in the beginning and 836.7MB in the end (delta: -730.7MB). Peak memory consumption was 154.8MB. Max. memory is 16.1GB. [2025-03-09 01:10:10,944 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:10:10,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.08ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 83.8MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:10:10,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.27ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 80.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:10:10,944 INFO L158 Benchmark]: Boogie Preprocessor took 53.28ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 78.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:10:10,945 INFO L158 Benchmark]: IcfgBuilder took 582.24ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 94.4MB in the end (delta: -16.4MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2025-03-09 01:10:10,945 INFO L158 Benchmark]: TraceAbstraction took 8504.52ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 94.4MB in the beginning and 836.8MB in the end (delta: -742.4MB). Peak memory consumption was 132.2MB. Max. memory is 16.1GB. [2025-03-09 01:10:10,945 INFO L158 Benchmark]: Witness Printer took 2.09ms. Allocated memory is still 1.0GB. Free memory was 836.8MB in the beginning and 836.7MB in the end (delta: 140.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:10:10,947 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.80ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.08ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 83.8MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.27ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 80.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.28ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 78.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 582.24ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 94.4MB in the end (delta: -16.4MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8504.52ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 94.4MB in the beginning and 836.8MB in the end (delta: -742.4MB). Peak memory consumption was 132.2MB. Max. memory is 16.1GB. * Witness Printer took 2.09ms. Allocated memory is still 1.0GB. Free memory was 836.8MB in the beginning and 836.7MB in the end (delta: 140.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2345; [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2345=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2346; [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2345=-1, t2346=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L837] 0 pthread_t t2347; [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2345=-1, t2346=0, t2347=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L788] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L746] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345=-1, t2346=0, t2347=1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345=-1, t2346=0, t2347=1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345=-1, t2346=0, t2347=1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 68 edges, 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: 8.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 722 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1623 IncrementalHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 3 mSDtfsCounter, 1623 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=8, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 757 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-03-09 01:10:10,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 0917507184a262ba6442de2995b8b922c1a1388e63695c7a63bfd1ed6f65ad74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:10:12,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:10:12,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-09 01:10:12,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:10:12,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:10:12,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:10:12,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:10:12,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:10:12,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:10:12,998 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:10:12,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:10:12,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:10:12,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:10:12,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:10:12,999 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:10:12,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:10:12,999 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:10:12,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:10:12,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:10:12,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:10:12,999 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:10:12,999 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:10:12,999 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:10:13,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:10:13,001 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:10:13,001 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 01:10:13,001 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 01:10:13,001 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:10:13,001 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:10:13,001 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:10:13,001 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:10:13,001 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:10:13,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:10:13,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:10:13,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:10:13,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:10:13,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:10:13,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:10:13,002 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 01:10:13,002 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 01:10:13,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:10:13,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:10:13,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:10:13,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:10:13,003 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/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 -> 0917507184a262ba6442de2995b8b922c1a1388e63695c7a63bfd1ed6f65ad74 [2025-03-09 01:10:13,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:10:13,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:10:13,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:10:13,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:10:13,262 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:10:13,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-09 01:10:14,450 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/937bdcd28/78609b2c7ce84eecaa05d5705668570e/FLAG3f0d8333f [2025-03-09 01:10:14,704 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:10:14,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-09 01:10:14,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/937bdcd28/78609b2c7ce84eecaa05d5705668570e/FLAG3f0d8333f [2025-03-09 01:10:15,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/937bdcd28/78609b2c7ce84eecaa05d5705668570e [2025-03-09 01:10:15,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:10:15,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:10:15,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:10:15,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:10:15,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:10:15,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:10:15" (1/1) ... [2025-03-09 01:10:15,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4c1293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15, skipping insertion in model container [2025-03-09 01:10:15,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:10:15" (1/1) ... [2025-03-09 01:10:15,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:10:15,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:10:15,284 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:10:15,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:10:15,368 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:10:15,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15 WrapperNode [2025-03-09 01:10:15,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:10:15,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:10:15,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:10:15,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:10:15,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15" (1/1) ... [2025-03-09 01:10:15,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15" (1/1) ... [2025-03-09 01:10:15,415 INFO L138 Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 121 [2025-03-09 01:10:15,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:10:15,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:10:15,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:10:15,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:10:15,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15" (1/1) ... [2025-03-09 01:10:15,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15" (1/1) ... [2025-03-09 01:10:15,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15" (1/1) ... [2025-03-09 01:10:15,436 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-03-09 01:10:15,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15" (1/1) ... [2025-03-09 01:10:15,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15" (1/1) ... [2025-03-09 01:10:15,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15" (1/1) ... [2025-03-09 01:10:15,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15" (1/1) ... [2025-03-09 01:10:15,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15" (1/1) ... [2025-03-09 01:10:15,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15" (1/1) ... [2025-03-09 01:10:15,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:10:15,457 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:10:15,457 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:10:15,457 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:10:15,458 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15" (1/1) ... [2025-03-09 01:10:15,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:10:15,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:10:15,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:10:15,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:10:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:10:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:10:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 01:10:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-09 01:10:15,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-09 01:10:15,506 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-09 01:10:15,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-09 01:10:15,506 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-09 01:10:15,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-09 01:10:15,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:10:15,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:10:15,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:10:15,507 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:10:15,603 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:10:15,605 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:10:15,885 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:10:15,885 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:10:16,071 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:10:16,072 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:10:16,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:10:16 BoogieIcfgContainer [2025-03-09 01:10:16,072 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:10:16,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:10:16,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:10:16,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:10:16,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:10:15" (1/3) ... [2025-03-09 01:10:16,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760b9ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:10:16, skipping insertion in model container [2025-03-09 01:10:16,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:10:15" (2/3) ... [2025-03-09 01:10:16,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760b9ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:10:16, skipping insertion in model container [2025-03-09 01:10:16,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:10:16" (3/3) ... [2025-03-09 01:10:16,081 INFO L128 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-09 01:10:16,091 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:10:16,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-09 01:10:16,093 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:10:16,143 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:10:16,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2025-03-09 01:10:16,194 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2025-03-09 01:10:16,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:10:16,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-03-09 01:10:16,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2025-03-09 01:10:16,203 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2025-03-09 01:10:16,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:10:16,218 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;@122a7a96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:10:16,218 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-09 01:10:16,224 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:10:16,224 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-09 01:10:16,225 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:10:16,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:16,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:10:16,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:16,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:16,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1748133811, now seen corresponding path program 1 times [2025-03-09 01:10:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:10:16,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633290850] [2025-03-09 01:10:16,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:16,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:16,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:10:16,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:10:16,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:10:16,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:10:16,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:10:16,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:16,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:16,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:10:16,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:10:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:16,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:10:16,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:10:16,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633290850] [2025-03-09 01:10:16,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633290850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:16,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:16,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:10:16,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841323214] [2025-03-09 01:10:16,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:16,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:10:16,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:10:16,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:10:16,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:10:16,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-09 01:10:16,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-09 01:10:16,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:16,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-09 01:10:16,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:17,340 INFO L124 PetriNetUnfolderBase]: 6263/9043 cut-off events. [2025-03-09 01:10:17,341 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-09 01:10:17,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18030 conditions, 9043 events. 6263/9043 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 50857 event pairs, 693 based on Foata normal form. 504/9532 useless extension candidates. Maximal degree in co-relation 18019. Up to 7741 conditions per place. [2025-03-09 01:10:17,385 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-03-09 01:10:17,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 238 flow [2025-03-09 01:10:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:10:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:10:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-03-09 01:10:17,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2025-03-09 01:10:17,394 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 88 transitions. [2025-03-09 01:10:17,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 238 flow [2025-03-09 01:10:17,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:10:17,399 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2025-03-09 01:10:17,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-03-09 01:10:17,403 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-03-09 01:10:17,403 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2025-03-09 01:10:17,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-09 01:10:17,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:17,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:10:17,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:10:17,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:17,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:17,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:17,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1726226081, now seen corresponding path program 1 times [2025-03-09 01:10:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:10:17,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48357673] [2025-03-09 01:10:17,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:17,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:17,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:10:17,611 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:10:17,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:10:17,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:10:17,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:10:17,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:17,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:17,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 01:10:17,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:10:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:17,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:10:17,707 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:10:17,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48357673] [2025-03-09 01:10:17,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48357673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:17,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:17,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:10:17,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516715849] [2025-03-09 01:10:17,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:17,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:10:17,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:10:17,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:10:17,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:10:17,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-09 01:10:17,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:17,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:17,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-09 01:10:17,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:18,347 INFO L124 PetriNetUnfolderBase]: 5627/8719 cut-off events. [2025-03-09 01:10:18,347 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-03-09 01:10:18,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17209 conditions, 8719 events. 5627/8719 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 52237 event pairs, 5627 based on Foata normal form. 252/8916 useless extension candidates. Maximal degree in co-relation 17199. Up to 7994 conditions per place. [2025-03-09 01:10:18,393 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 28 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2025-03-09 01:10:18,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 142 flow [2025-03-09 01:10:18,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:10:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:10:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-09 01:10:18,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2025-03-09 01:10:18,395 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 58 transitions. [2025-03-09 01:10:18,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 142 flow [2025-03-09 01:10:18,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:10:18,397 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2025-03-09 01:10:18,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-03-09 01:10:18,398 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-03-09 01:10:18,398 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2025-03-09 01:10:18,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:18,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:18,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:10:18,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:10:18,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:18,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:18,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:18,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1726226519, now seen corresponding path program 1 times [2025-03-09 01:10:18,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:10:18,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464314359] [2025-03-09 01:10:18,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:18,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:18,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:10:18,603 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:10:18,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:10:18,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:10:18,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:10:18,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:18,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:18,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:10:18,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:10:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:18,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:10:18,722 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:10:18,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464314359] [2025-03-09 01:10:18,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464314359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:18,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:18,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:10:18,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721808314] [2025-03-09 01:10:18,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:18,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:10:18,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:10:18,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:10:18,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:10:18,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-09 01:10:18,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:18,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:18,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-09 01:10:18,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:19,237 INFO L124 PetriNetUnfolderBase]: 4015/6429 cut-off events. [2025-03-09 01:10:19,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:10:19,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12435 conditions, 6429 events. 4015/6429 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 38452 event pairs, 661 based on Foata normal form. 252/6668 useless extension candidates. Maximal degree in co-relation 12429. Up to 3409 conditions per place. [2025-03-09 01:10:19,260 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 58 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2025-03-09 01:10:19,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 280 flow [2025-03-09 01:10:19,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:10:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:10:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-09 01:10:19,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-03-09 01:10:19,262 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 106 transitions. [2025-03-09 01:10:19,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 280 flow [2025-03-09 01:10:19,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:10:19,265 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow [2025-03-09 01:10:19,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-03-09 01:10:19,265 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2025-03-09 01:10:19,265 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow [2025-03-09 01:10:19,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:19,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:19,266 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-03-09 01:10:19,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:10:19,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:19,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:19,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:19,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1078472706, now seen corresponding path program 1 times [2025-03-09 01:10:19,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:10:19,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1217837736] [2025-03-09 01:10:19,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:19,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:19,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:10:19,469 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:10:19,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:10:19,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:10:19,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:10:19,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:19,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:19,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:10:19,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:10:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:19,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:10:19,569 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:10:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217837736] [2025-03-09 01:10:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217837736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:19,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:19,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:10:19,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019931376] [2025-03-09 01:10:19,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:19,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:10:19,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:10:19,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:10:19,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:10:19,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-09 01:10:19,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:19,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:19,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-09 01:10:19,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:19,919 INFO L124 PetriNetUnfolderBase]: 2207/3533 cut-off events. [2025-03-09 01:10:19,920 INFO L125 PetriNetUnfolderBase]: For 658/658 co-relation queries the response was YES. [2025-03-09 01:10:19,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7982 conditions, 3533 events. 2207/3533 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 18145 event pairs, 427 based on Foata normal form. 172/3692 useless extension candidates. Maximal degree in co-relation 7973. Up to 1128 conditions per place. [2025-03-09 01:10:19,933 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 74 selfloop transitions, 8 changer transitions 1/89 dead transitions. [2025-03-09 01:10:19,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 89 transitions, 400 flow [2025-03-09 01:10:19,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:10:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:10:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-09 01:10:19,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-09 01:10:19,935 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 135 transitions. [2025-03-09 01:10:19,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 89 transitions, 400 flow [2025-03-09 01:10:19,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 89 transitions, 390 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:10:19,938 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow [2025-03-09 01:10:19,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2025-03-09 01:10:19,939 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-03-09 01:10:19,939 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow [2025-03-09 01:10:19,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:10:19,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:19,939 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] [2025-03-09 01:10:19,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:10:20,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:20,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:20,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:20,144 INFO L85 PathProgramCache]: Analyzing trace with hash 865367580, now seen corresponding path program 1 times [2025-03-09 01:10:20,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:10:20,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133287534] [2025-03-09 01:10:20,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:20,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:20,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:10:20,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:10:20,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:10:20,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:10:20,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:10:20,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:20,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:20,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:10:20,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:10:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:20,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:10:20,276 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:10:20,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133287534] [2025-03-09 01:10:20,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133287534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:20,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:20,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:10:20,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101537504] [2025-03-09 01:10:20,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:20,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:10:20,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:10:20,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:10:20,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:10:20,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-09 01:10:20,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-03-09 01:10:20,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:20,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-09 01:10:20,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:20,569 INFO L124 PetriNetUnfolderBase]: 1355/2101 cut-off events. [2025-03-09 01:10:20,570 INFO L125 PetriNetUnfolderBase]: For 1232/1232 co-relation queries the response was YES. [2025-03-09 01:10:20,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5224 conditions, 2101 events. 1355/2101 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9392 event pairs, 385 based on Foata normal form. 60/2148 useless extension candidates. Maximal degree in co-relation 5213. Up to 788 conditions per place. [2025-03-09 01:10:20,579 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 62 selfloop transitions, 11 changer transitions 1/80 dead transitions. [2025-03-09 01:10:20,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 387 flow [2025-03-09 01:10:20,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:10:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:10:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-03-09 01:10:20,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2025-03-09 01:10:20,582 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 136 transitions. [2025-03-09 01:10:20,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 387 flow [2025-03-09 01:10:20,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 362 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-09 01:10:20,595 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow [2025-03-09 01:10:20,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2025-03-09 01:10:20,598 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-03-09 01:10:20,598 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow [2025-03-09 01:10:20,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-03-09 01:10:20,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:20,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:10:20,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:10:20,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:20,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:20,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:20,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1699116955, now seen corresponding path program 1 times [2025-03-09 01:10:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:10:20,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339729937] [2025-03-09 01:10:20,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:10:20,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:20,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:10:20,803 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:10:20,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:10:20,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:10:20,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:10:20,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:20,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:20,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:10:20,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:10:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:21,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:10:21,038 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:10:21,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339729937] [2025-03-09 01:10:21,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339729937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:21,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:21,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:10:21,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469327982] [2025-03-09 01:10:21,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:21,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:10:21,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:10:21,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:10:21,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:10:21,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-09 01:10:21,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 165 flow. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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-03-09 01:10:21,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:21,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-09 01:10:21,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:21,397 INFO L124 PetriNetUnfolderBase]: 1913/2967 cut-off events. [2025-03-09 01:10:21,397 INFO L125 PetriNetUnfolderBase]: For 1942/1942 co-relation queries the response was YES. [2025-03-09 01:10:21,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7471 conditions, 2967 events. 1913/2967 cut-off events. For 1942/1942 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14256 event pairs, 303 based on Foata normal form. 8/2962 useless extension candidates. Maximal degree in co-relation 7459. Up to 1224 conditions per place. [2025-03-09 01:10:21,407 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 63 selfloop transitions, 7 changer transitions 25/101 dead transitions. [2025-03-09 01:10:21,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 101 transitions, 565 flow [2025-03-09 01:10:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:10:21,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:10:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2025-03-09 01:10:21,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4984126984126984 [2025-03-09 01:10:21,409 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 7 states and 157 transitions. [2025-03-09 01:10:21,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 101 transitions, 565 flow [2025-03-09 01:10:21,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 101 transitions, 448 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-09 01:10:21,421 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 166 flow [2025-03-09 01:10:21,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=166, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-03-09 01:10:21,421 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2025-03-09 01:10:21,422 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 166 flow [2025-03-09 01:10:21,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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-03-09 01:10:21,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:21,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:10:21,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:10:21,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:21,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:21,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:21,627 INFO L85 PathProgramCache]: Analyzing trace with hash -984387999, now seen corresponding path program 2 times [2025-03-09 01:10:21,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:10:21,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620003491] [2025-03-09 01:10:21,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:10:21,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:21,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:10:21,629 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:10:21,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:10:21,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:10:21,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:10:21,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:10:21,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:21,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:10:21,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:10:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:21,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:10:21,771 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:10:21,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620003491] [2025-03-09 01:10:21,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620003491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:21,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:21,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:10:21,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280739714] [2025-03-09 01:10:21,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:21,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:10:21,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:10:21,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:10:21,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:10:21,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-09 01:10:21,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 166 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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-03-09 01:10:21,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:21,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-09 01:10:21,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:22,120 INFO L124 PetriNetUnfolderBase]: 1409/2228 cut-off events. [2025-03-09 01:10:22,120 INFO L125 PetriNetUnfolderBase]: For 720/720 co-relation queries the response was YES. [2025-03-09 01:10:22,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5337 conditions, 2228 events. 1409/2228 cut-off events. For 720/720 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10324 event pairs, 119 based on Foata normal form. 8/2235 useless extension candidates. Maximal degree in co-relation 5324. Up to 1272 conditions per place. [2025-03-09 01:10:22,126 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 45 selfloop transitions, 1 changer transitions 47/99 dead transitions. [2025-03-09 01:10:22,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 99 transitions, 525 flow [2025-03-09 01:10:22,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:10:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:10:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2025-03-09 01:10:22,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45396825396825397 [2025-03-09 01:10:22,128 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 166 flow. Second operand 7 states and 143 transitions. [2025-03-09 01:10:22,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 99 transitions, 525 flow [2025-03-09 01:10:22,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 99 transitions, 509 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-09 01:10:22,130 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 151 flow [2025-03-09 01:10:22,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=151, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2025-03-09 01:10:22,131 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2025-03-09 01:10:22,132 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 151 flow [2025-03-09 01:10:22,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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-03-09 01:10:22,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:22,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:10:22,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:10:22,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:22,337 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:22,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1575118309, now seen corresponding path program 3 times [2025-03-09 01:10:22,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:10:22,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [358543399] [2025-03-09 01:10:22,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:10:22,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:22,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:10:22,340 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:10:22,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:10:22,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:10:22,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:10:22,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:10:22,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:10:22,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:10:22,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:10:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:10:22,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:10:22,697 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:10:22,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358543399] [2025-03-09 01:10:22,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358543399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:10:22,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:10:22,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:10:22,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512366087] [2025-03-09 01:10:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:10:22,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:10:22,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:10:22,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:10:22,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:10:22,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-09 01:10:22,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 151 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 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-03-09 01:10:22,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:10:22,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-09 01:10:22,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:10:23,062 INFO L124 PetriNetUnfolderBase]: 1105/1819 cut-off events. [2025-03-09 01:10:23,063 INFO L125 PetriNetUnfolderBase]: For 628/628 co-relation queries the response was YES. [2025-03-09 01:10:23,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4443 conditions, 1819 events. 1105/1819 cut-off events. For 628/628 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 8165 event pairs, 162 based on Foata normal form. 8/1824 useless extension candidates. Maximal degree in co-relation 4427. Up to 852 conditions per place. [2025-03-09 01:10:23,069 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 46 selfloop transitions, 4 changer transitions 50/106 dead transitions. [2025-03-09 01:10:23,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 106 transitions, 551 flow [2025-03-09 01:10:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:10:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:10:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2025-03-09 01:10:23,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2025-03-09 01:10:23,070 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 151 flow. Second operand 10 states and 183 transitions. [2025-03-09 01:10:23,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 106 transitions, 551 flow [2025-03-09 01:10:23,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 524 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-03-09 01:10:23,073 INFO L231 Difference]: Finished difference. Result has 67 places, 41 transitions, 145 flow [2025-03-09 01:10:23,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=145, PETRI_PLACES=67, PETRI_TRANSITIONS=41} [2025-03-09 01:10:23,074 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2025-03-09 01:10:23,074 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 41 transitions, 145 flow [2025-03-09 01:10:23,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 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-03-09 01:10:23,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:10:23,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:10:23,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:10:23,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:23,275 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 01:10:23,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:10:23,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1983538213, now seen corresponding path program 4 times [2025-03-09 01:10:23,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:10:23,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113738271] [2025-03-09 01:10:23,276 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:10:23,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:23,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:10:23,278 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:10:23,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:10:23,328 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-09 01:10:23,347 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:10:23,348 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:10:23,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:10:23,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:10:23,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:10:23,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:10:23,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:10:23,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:10:23,432 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-09 01:10:23,432 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:10:23,433 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-09 01:10:23,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-09 01:10:23,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-09 01:10:23,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-09 01:10:23,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-09 01:10:23,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-09 01:10:23,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-09 01:10:23,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:10:23,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:10:23,637 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2025-03-09 01:10:23,704 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:10:23,704 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:10:23,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:10:23 BasicIcfg [2025-03-09 01:10:23,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:10:23,711 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:10:23,711 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:10:23,712 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:10:23,712 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:10:16" (3/4) ... [2025-03-09 01:10:23,714 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 01:10:23,714 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:10:23,715 INFO L158 Benchmark]: Toolchain (without parser) took 8688.17ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 91.0MB in the beginning and 748.7MB in the end (delta: -657.7MB). Peak memory consumption was 131.3MB. Max. memory is 16.1GB. [2025-03-09 01:10:23,715 INFO L158 Benchmark]: CDTParser took 1.76ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 61.7MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:10:23,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.64ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 68.0MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:10:23,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.57ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:10:23,715 INFO L158 Benchmark]: Boogie Preprocessor took 40.88ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 63.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:10:23,715 INFO L158 Benchmark]: IcfgBuilder took 614.62ms. Allocated memory is still 117.4MB. Free memory was 63.0MB in the beginning and 49.2MB in the end (delta: 13.8MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2025-03-09 01:10:23,716 INFO L158 Benchmark]: TraceAbstraction took 7636.21ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 48.3MB in the beginning and 753.0MB in the end (delta: -704.6MB). Peak memory consumption was 326.7MB. Max. memory is 16.1GB. [2025-03-09 01:10:23,716 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 906.0MB. Free memory was 753.0MB in the beginning and 748.7MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:10:23,717 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.76ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 61.7MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.64ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 68.0MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.57ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.88ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 63.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 614.62ms. Allocated memory is still 117.4MB. Free memory was 63.0MB in the beginning and 49.2MB in the end (delta: 13.8MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7636.21ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 48.3MB in the beginning and 753.0MB in the end (delta: -704.6MB). Peak memory consumption was 326.7MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 906.0MB. Free memory was 753.0MB in the beginning and 748.7MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2345; [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2345=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2346; [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2345=0, t2346=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L837] 0 pthread_t t2347; [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2345=0, t2346=1, t2347=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L788] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L746] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345=0, t2346=1, t2347=2, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345=0, t2346=1, t2347=2, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345=0, t2346=1, t2347=2, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 68 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 485 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 478 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1456 IncrementalHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 5 mSDtfsCounter, 1456 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=6, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 789 SizeOfPredicates, 24 NumberOfNonLiveVariables, 815 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 01:10:23,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample