./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe013_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 798a7b37 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/safe013_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 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:55:29,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:55:29,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:55:29,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:55:29,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:55:29,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:55:29,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:55:29,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:55:29,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:55:29,329 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:55:29,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:55:29,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:55:29,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:55:29,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:55:29,329 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:55:29,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:55:29,329 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:55:29,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:55:29,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:55:29,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:55:29,329 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:55:29,329 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:55:29,330 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:55:29,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:55:29,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:55:29,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:55:29,331 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 -> 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 [2025-03-04 09:55:29,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:55:29,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:55:29,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:55:29,576 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:55:29,576 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:55:29,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:55:30,804 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f713fcb4/bdcc3a7c27ea44b5b4e91cf4f634b67a/FLAGacaf48a38 [2025-03-04 09:55:31,136 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:55:31,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:55:31,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f713fcb4/bdcc3a7c27ea44b5b4e91cf4f634b67a/FLAGacaf48a38 [2025-03-04 09:55:31,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f713fcb4/bdcc3a7c27ea44b5b4e91cf4f634b67a [2025-03-04 09:55:31,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:55:31,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:55:31,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:55:31,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:55:31,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:55:31,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:55:31" (1/1) ... [2025-03-04 09:55:31,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1298cda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31, skipping insertion in model container [2025-03-04 09:55:31,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:55:31" (1/1) ... [2025-03-04 09:55:31,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:55:31,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:55:31,749 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:55:31,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:55:31,819 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:55:31,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31 WrapperNode [2025-03-04 09:55:31,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:55:31,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:55:31,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:55:31,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:55:31,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31" (1/1) ... [2025-03-04 09:55:31,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31" (1/1) ... [2025-03-04 09:55:31,854 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2025-03-04 09:55:31,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:55:31,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:55:31,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:55:31,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:55:31,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31" (1/1) ... [2025-03-04 09:55:31,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31" (1/1) ... [2025-03-04 09:55:31,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31" (1/1) ... [2025-03-04 09:55:31,874 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-04 09:55:31,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31" (1/1) ... [2025-03-04 09:55:31,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31" (1/1) ... [2025-03-04 09:55:31,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31" (1/1) ... [2025-03-04 09:55:31,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31" (1/1) ... [2025-03-04 09:55:31,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31" (1/1) ... [2025-03-04 09:55:31,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31" (1/1) ... [2025-03-04 09:55:31,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:55:31,884 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:55:31,884 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:55:31,884 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:55:31,885 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31" (1/1) ... [2025-03-04 09:55:31,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:55:31,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:55:31,914 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-04 09:55:31,916 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-04 09:55:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:55:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:55:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:55:31,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:55:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:55:31,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:55:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:55:31,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:55:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:55:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:55:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:55:31,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:55:31,935 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:55:32,028 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:55:32,029 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:55:32,295 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:55:32,295 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:55:32,456 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:55:32,457 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:55:32,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:55:32 BoogieIcfgContainer [2025-03-04 09:55:32,457 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:55:32,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:55:32,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:55:32,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:55:32,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:55:31" (1/3) ... [2025-03-04 09:55:32,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a32c951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:55:32, skipping insertion in model container [2025-03-04 09:55:32,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:31" (2/3) ... [2025-03-04 09:55:32,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a32c951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:55:32, skipping insertion in model container [2025-03-04 09:55:32,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:55:32" (3/3) ... [2025-03-04 09:55:32,467 INFO L128 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:55:32,479 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:55:32,481 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe013_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-04 09:55:32,481 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:55:32,521 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:55:32,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2025-03-04 09:55:32,577 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2025-03-04 09:55:32,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:55:32,582 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 81 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-04 09:55:32,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2025-03-04 09:55:32,584 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2025-03-04 09:55:32,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:55:32,606 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;@615d1f30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:55:32,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 09:55:32,612 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:55:32,613 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-04 09:55:32,614 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:55:32,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:32,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:55:32,615 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-04 09:55:32,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:32,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1866467635, now seen corresponding path program 1 times [2025-03-04 09:55:32,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:32,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695069015] [2025-03-04 09:55:32,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:32,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:32,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:55:32,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:55:32,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:32,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:33,033 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-04 09:55:33,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:33,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695069015] [2025-03-04 09:55:33,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695069015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:33,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:33,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:55:33,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43129206] [2025-03-04 09:55:33,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:33,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:55:33,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:33,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:55:33,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:55:33,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:55:33,062 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-04 09:55:33,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:33,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:55:33,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:34,044 INFO L124 PetriNetUnfolderBase]: 6263/9057 cut-off events. [2025-03-04 09:55:34,044 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 09:55:34,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18044 conditions, 9057 events. 6263/9057 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 50962 event pairs, 693 based on Foata normal form. 504/9557 useless extension candidates. Maximal degree in co-relation 18033. Up to 7741 conditions per place. [2025-03-04 09:55:34,098 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-03-04 09:55:34,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 238 flow [2025-03-04 09:55:34,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:55:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:55:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-03-04 09:55:34,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2025-03-04 09:55:34,111 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 88 transitions. [2025-03-04 09:55:34,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 238 flow [2025-03-04 09:55:34,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:55:34,119 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2025-03-04 09:55:34,121 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-04 09:55:34,125 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-03-04 09:55:34,125 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2025-03-04 09:55:34,125 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-04 09:55:34,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:34,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:34,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:55:34,126 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-04 09:55:34,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:34,126 INFO L85 PathProgramCache]: Analyzing trace with hash -468001032, now seen corresponding path program 1 times [2025-03-04 09:55:34,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:34,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603666649] [2025-03-04 09:55:34,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:34,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:34,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:55:34,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:55:34,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:34,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:34,192 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-04 09:55:34,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:34,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603666649] [2025-03-04 09:55:34,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603666649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:34,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:34,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:55:34,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934234057] [2025-03-04 09:55:34,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:34,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:55:34,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:34,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:55:34,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:55:34,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:55:34,197 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-04 09:55:34,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:34,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:55:34,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:34,734 INFO L124 PetriNetUnfolderBase]: 5627/8761 cut-off events. [2025-03-04 09:55:34,734 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-03-04 09:55:34,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17251 conditions, 8761 events. 5627/8761 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 52751 event pairs, 5627 based on Foata normal form. 252/9008 useless extension candidates. Maximal degree in co-relation 17241. Up to 7994 conditions per place. [2025-03-04 09:55:34,772 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 28 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2025-03-04 09:55:34,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 142 flow [2025-03-04 09:55:34,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:55:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:55:34,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-04 09:55:34,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2025-03-04 09:55:34,774 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 58 transitions. [2025-03-04 09:55:34,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 142 flow [2025-03-04 09:55:34,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:55:34,775 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2025-03-04 09:55:34,776 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-04 09:55:34,776 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-03-04 09:55:34,776 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2025-03-04 09:55:34,776 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-04 09:55:34,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:34,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:34,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:55:34,776 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-04 09:55:34,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:34,777 INFO L85 PathProgramCache]: Analyzing trace with hash -468000576, now seen corresponding path program 1 times [2025-03-04 09:55:34,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:34,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543253786] [2025-03-04 09:55:34,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:34,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:34,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:55:34,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:55:34,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:34,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:55:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543253786] [2025-03-04 09:55:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543253786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:34,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:55:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370392464] [2025-03-04 09:55:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:34,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:55:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:34,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:55:34,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:55:34,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:55:34,983 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-04 09:55:34,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:34,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:55:34,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:36,018 INFO L124 PetriNetUnfolderBase]: 6873/10259 cut-off events. [2025-03-04 09:55:36,019 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:55:36,028 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 58782 event pairs, 972 based on Foata normal form. 0/10044 useless extension candidates. Maximal degree in co-relation 20185. Up to 5865 conditions per place. [2025-03-04 09:55:36,053 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 42 selfloop transitions, 2 changer transitions 75/124 dead transitions. [2025-03-04 09:55:36,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 124 transitions, 494 flow [2025-03-04 09:55:36,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:55:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:55:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2025-03-04 09:55:36,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5361111111111111 [2025-03-04 09:55:36,056 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 8 states and 193 transitions. [2025-03-04 09:55:36,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 124 transitions, 494 flow [2025-03-04 09:55:36,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:55:36,062 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 91 flow [2025-03-04 09:55:36,062 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-04 09:55:36,063 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-03-04 09:55:36,063 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 91 flow [2025-03-04 09:55:36,063 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-04 09:55:36,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:36,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:36,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:55:36,064 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-04 09:55:36,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:36,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1510220511, now seen corresponding path program 1 times [2025-03-04 09:55:36,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:36,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263071501] [2025-03-04 09:55:36,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:36,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:36,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:55:36,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:55:36,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:36,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:36,241 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-04 09:55:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263071501] [2025-03-04 09:55:36,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263071501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:36,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:36,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:55:36,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672009144] [2025-03-04 09:55:36,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:36,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:55:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:36,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:55:36,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:55:36,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:55:36,245 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-04 09:55:36,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:36,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:55:36,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:37,176 INFO L124 PetriNetUnfolderBase]: 8473/12596 cut-off events. [2025-03-04 09:55:37,177 INFO L125 PetriNetUnfolderBase]: For 3043/3043 co-relation queries the response was YES. [2025-03-04 09:55:37,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27716 conditions, 12596 events. 8473/12596 cut-off events. For 3043/3043 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 75677 event pairs, 529 based on Foata normal form. 354/12949 useless extension candidates. Maximal degree in co-relation 27704. Up to 5749 conditions per place. [2025-03-04 09:55:37,235 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 58 selfloop transitions, 6 changer transitions 75/144 dead transitions. [2025-03-04 09:55:37,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 144 transitions, 620 flow [2025-03-04 09:55:37,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:55:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:55:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 232 transitions. [2025-03-04 09:55:37,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5155555555555555 [2025-03-04 09:55:37,240 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 91 flow. Second operand 10 states and 232 transitions. [2025-03-04 09:55:37,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 144 transitions, 620 flow [2025-03-04 09:55:37,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 144 transitions, 586 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-03-04 09:55:37,432 INFO L231 Difference]: Finished difference. Result has 60 places, 37 transitions, 126 flow [2025-03-04 09:55:37,432 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=126, PETRI_PLACES=60, PETRI_TRANSITIONS=37} [2025-03-04 09:55:37,433 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2025-03-04 09:55:37,433 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 37 transitions, 126 flow [2025-03-04 09:55:37,433 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-04 09:55:37,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:37,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:37,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:55:37,434 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-04 09:55:37,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:37,435 INFO L85 PathProgramCache]: Analyzing trace with hash 787273000, now seen corresponding path program 1 times [2025-03-04 09:55:37,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:37,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692674396] [2025-03-04 09:55:37,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:37,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:37,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:55:37,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:55:37,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:37,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:37,592 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-04 09:55:37,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:37,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692674396] [2025-03-04 09:55:37,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692674396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:37,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:37,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:55:37,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251877974] [2025-03-04 09:55:37,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:37,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:55:37,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:37,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:55:37,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:55:37,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:55:37,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 37 transitions, 126 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-04 09:55:37,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:37,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:55:37,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:38,660 INFO L124 PetriNetUnfolderBase]: 10122/14928 cut-off events. [2025-03-04 09:55:38,661 INFO L125 PetriNetUnfolderBase]: For 9202/9202 co-relation queries the response was YES. [2025-03-04 09:55:38,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36063 conditions, 14928 events. 10122/14928 cut-off events. For 9202/9202 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 89630 event pairs, 1539 based on Foata normal form. 324/15247 useless extension candidates. Maximal degree in co-relation 36047. Up to 4576 conditions per place. [2025-03-04 09:55:38,701 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 66 selfloop transitions, 7 changer transitions 69/147 dead transitions. [2025-03-04 09:55:38,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 147 transitions, 761 flow [2025-03-04 09:55:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:55:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:55:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2025-03-04 09:55:38,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.528395061728395 [2025-03-04 09:55:38,703 INFO L175 Difference]: Start difference. First operand has 60 places, 37 transitions, 126 flow. Second operand 9 states and 214 transitions. [2025-03-04 09:55:38,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 147 transitions, 761 flow [2025-03-04 09:55:38,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 147 transitions, 737 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-03-04 09:55:38,722 INFO L231 Difference]: Finished difference. Result has 64 places, 37 transitions, 148 flow [2025-03-04 09:55:38,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=148, PETRI_PLACES=64, PETRI_TRANSITIONS=37} [2025-03-04 09:55:38,723 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2025-03-04 09:55:38,724 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 37 transitions, 148 flow [2025-03-04 09:55:38,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-04 09:55:38,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:38,725 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-04 09:55:38,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:55:38,725 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-04 09:55:38,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:38,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1766910190, now seen corresponding path program 1 times [2025-03-04 09:55:38,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:38,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645643307] [2025-03-04 09:55:38,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:38,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:38,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:55:38,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:55:38,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:38,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:38,868 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-04 09:55:38,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:38,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645643307] [2025-03-04 09:55:38,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645643307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:38,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:38,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:55:38,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256899183] [2025-03-04 09:55:38,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:38,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:55:38,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:38,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:55:38,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:55:38,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:55:38,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 37 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:55:38,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:38,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:55:38,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:39,441 INFO L124 PetriNetUnfolderBase]: 4047/6427 cut-off events. [2025-03-04 09:55:39,441 INFO L125 PetriNetUnfolderBase]: For 4785/4785 co-relation queries the response was YES. [2025-03-04 09:55:39,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16201 conditions, 6427 events. 4047/6427 cut-off events. For 4785/4785 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 36722 event pairs, 695 based on Foata normal form. 278/6702 useless extension candidates. Maximal degree in co-relation 16181. Up to 3519 conditions per place. [2025-03-04 09:55:39,470 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 67 selfloop transitions, 5 changer transitions 1/78 dead transitions. [2025-03-04 09:55:39,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 456 flow [2025-03-04 09:55:39,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:55:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:55:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-04 09:55:39,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-03-04 09:55:39,472 INFO L175 Difference]: Start difference. First operand has 64 places, 37 transitions, 148 flow. Second operand 4 states and 106 transitions. [2025-03-04 09:55:39,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 456 flow [2025-03-04 09:55:39,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 402 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-03-04 09:55:39,482 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 154 flow [2025-03-04 09:55:39,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2025-03-04 09:55:39,482 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2025-03-04 09:55:39,483 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 154 flow [2025-03-04 09:55:39,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:55:39,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:39,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:39,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:55:39,483 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-04 09:55:39,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:39,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1779403011, now seen corresponding path program 1 times [2025-03-04 09:55:39,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:39,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657022904] [2025-03-04 09:55:39,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:39,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:39,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:55:39,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:55:39,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:39,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:39,666 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-04 09:55:39,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:39,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657022904] [2025-03-04 09:55:39,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657022904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:39,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:39,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:55:39,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255069688] [2025-03-04 09:55:39,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:39,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:55:39,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:39,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:55:39,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:55:39,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:55:39,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-04 09:55:39,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:39,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:55:39,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:39,953 INFO L124 PetriNetUnfolderBase]: 2425/3879 cut-off events. [2025-03-04 09:55:39,953 INFO L125 PetriNetUnfolderBase]: For 2158/2158 co-relation queries the response was YES. [2025-03-04 09:55:39,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10151 conditions, 3879 events. 2425/3879 cut-off events. For 2158/2158 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 19768 event pairs, 369 based on Foata normal form. 212/4088 useless extension candidates. Maximal degree in co-relation 10135. Up to 1305 conditions per place. [2025-03-04 09:55:39,965 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 77 selfloop transitions, 8 changer transitions 2/92 dead transitions. [2025-03-04 09:55:39,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 512 flow [2025-03-04 09:55:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:55:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:55:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-04 09:55:39,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822222222222222 [2025-03-04 09:55:39,966 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 154 flow. Second operand 5 states and 131 transitions. [2025-03-04 09:55:39,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 512 flow [2025-03-04 09:55:39,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 495 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 09:55:39,971 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 189 flow [2025-03-04 09:55:39,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2025-03-04 09:55:39,971 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2025-03-04 09:55:39,971 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 189 flow [2025-03-04 09:55:39,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-04 09:55:39,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:39,972 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] [2025-03-04 09:55:39,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:55:39,972 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-04 09:55:39,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:39,972 INFO L85 PathProgramCache]: Analyzing trace with hash -169709722, now seen corresponding path program 1 times [2025-03-04 09:55:39,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:39,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689481476] [2025-03-04 09:55:39,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:39,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:39,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 09:55:40,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 09:55:40,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:40,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:40,177 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-04 09:55:40,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:40,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689481476] [2025-03-04 09:55:40,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689481476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:40,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:40,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:55:40,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410434281] [2025-03-04 09:55:40,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:40,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:55:40,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:40,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:55:40,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:55:40,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:55:40,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-04 09:55:40,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:40,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:55:40,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:40,392 INFO L124 PetriNetUnfolderBase]: 1465/2311 cut-off events. [2025-03-04 09:55:40,392 INFO L125 PetriNetUnfolderBase]: For 2404/2404 co-relation queries the response was YES. [2025-03-04 09:55:40,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6554 conditions, 2311 events. 1465/2311 cut-off events. For 2404/2404 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 10455 event pairs, 291 based on Foata normal form. 92/2400 useless extension candidates. Maximal degree in co-relation 6537. Up to 788 conditions per place. [2025-03-04 09:55:40,399 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 59 selfloop transitions, 11 changer transitions 9/84 dead transitions. [2025-03-04 09:55:40,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 479 flow [2025-03-04 09:55:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:55:40,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:55:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2025-03-04 09:55:40,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2025-03-04 09:55:40,401 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 189 flow. Second operand 6 states and 134 transitions. [2025-03-04 09:55:40,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 479 flow [2025-03-04 09:55:40,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 84 transitions, 432 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-03-04 09:55:40,406 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 191 flow [2025-03-04 09:55:40,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2025-03-04 09:55:40,407 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2025-03-04 09:55:40,407 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 191 flow [2025-03-04 09:55:40,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-04 09:55:40,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:40,407 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-04 09:55:40,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:55:40,407 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-04 09:55:40,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:40,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1945745680, now seen corresponding path program 1 times [2025-03-04 09:55:40,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:40,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631882211] [2025-03-04 09:55:40,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:40,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:40,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:55:40,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:55:40,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:40,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:40,613 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-04 09:55:40,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:40,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631882211] [2025-03-04 09:55:40,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631882211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:40,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:40,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:55:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986498124] [2025-03-04 09:55:40,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:40,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:55:40,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:40,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:55:40,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:55:40,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:55:40,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-04 09:55:40,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:40,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:55:40,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:40,821 INFO L124 PetriNetUnfolderBase]: 1589/2511 cut-off events. [2025-03-04 09:55:40,821 INFO L125 PetriNetUnfolderBase]: For 2504/2504 co-relation queries the response was YES. [2025-03-04 09:55:40,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6984 conditions, 2511 events. 1589/2511 cut-off events. For 2504/2504 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11534 event pairs, 773 based on Foata normal form. 8/2516 useless extension candidates. Maximal degree in co-relation 6969. Up to 1309 conditions per place. [2025-03-04 09:55:40,827 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 42 selfloop transitions, 2 changer transitions 22/71 dead transitions. [2025-03-04 09:55:40,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 453 flow [2025-03-04 09:55:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:55:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:55:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2025-03-04 09:55:40,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44 [2025-03-04 09:55:40,828 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 191 flow. Second operand 5 states and 99 transitions. [2025-03-04 09:55:40,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 453 flow [2025-03-04 09:55:40,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 344 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-04 09:55:40,834 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 133 flow [2025-03-04 09:55:40,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2025-03-04 09:55:40,835 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2025-03-04 09:55:40,835 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 133 flow [2025-03-04 09:55:40,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-04 09:55:40,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:40,835 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-04 09:55:40,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:55:40,835 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-04 09:55:40,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:40,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1696870680, now seen corresponding path program 2 times [2025-03-04 09:55:40,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:40,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262113840] [2025-03-04 09:55:40,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:55:40,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:40,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:55:40,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:55:40,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:55:40,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:41,823 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-04 09:55:41,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:41,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262113840] [2025-03-04 09:55:41,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262113840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:41,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:41,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:55:41,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839855265] [2025-03-04 09:55:41,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:41,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:55:41,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:41,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:55:41,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:55:41,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:55:41,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 133 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 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-04 09:55:41,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:41,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:55:41,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:42,130 INFO L124 PetriNetUnfolderBase]: 741/1203 cut-off events. [2025-03-04 09:55:42,131 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2025-03-04 09:55:42,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2880 conditions, 1203 events. 741/1203 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4743 event pairs, 108 based on Foata normal form. 8/1210 useless extension candidates. Maximal degree in co-relation 2867. Up to 580 conditions per place. [2025-03-04 09:55:42,134 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 46 selfloop transitions, 4 changer transitions 36/91 dead transitions. [2025-03-04 09:55:42,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 91 transitions, 459 flow [2025-03-04 09:55:42,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:55:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:55:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2025-03-04 09:55:42,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3802469135802469 [2025-03-04 09:55:42,135 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 133 flow. Second operand 9 states and 154 transitions. [2025-03-04 09:55:42,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 91 transitions, 459 flow [2025-03-04 09:55:42,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 91 transitions, 419 flow, removed 9 selfloop flow, removed 8 redundant places. [2025-03-04 09:55:42,137 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 129 flow [2025-03-04 09:55:42,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=129, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2025-03-04 09:55:42,139 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2025-03-04 09:55:42,139 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 129 flow [2025-03-04 09:55:42,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 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-04 09:55:42,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:42,140 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-04 09:55:42,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:55:42,140 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-04 09:55:42,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:42,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1917865114, now seen corresponding path program 3 times [2025-03-04 09:55:42,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:42,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682166804] [2025-03-04 09:55:42,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:55:42,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:42,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:55:42,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:55:42,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:55:42,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:55:42,188 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:55:42,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:55:42,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:55:42,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:42,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:55:42,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:55:42,269 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:55:42,270 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-04 09:55:42,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-04 09:55:42,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-04 09:55:42,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 09:55:42,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-04 09:55:42,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-04 09:55:42,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 09:55:42,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:55:42,273 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:42,336 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:55:42,336 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:55:42,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:55:42 BasicIcfg [2025-03-04 09:55:42,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:55:42,344 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:55:42,344 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:55:42,345 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:55:42,345 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:55:32" (3/4) ... [2025-03-04 09:55:42,347 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 09:55:42,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:55:42,349 INFO L158 Benchmark]: Toolchain (without parser) took 10946.13ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 103.9MB in the beginning and 687.5MB in the end (delta: -583.5MB). Peak memory consumption was 475.7MB. Max. memory is 16.1GB. [2025-03-04 09:55:42,349 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:55:42,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.62ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 81.5MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:55:42,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.80ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 79.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:55:42,351 INFO L158 Benchmark]: Boogie Preprocessor took 28.94ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 76.1MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:55:42,351 INFO L158 Benchmark]: IcfgBuilder took 573.01ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 93.2MB in the end (delta: -17.1MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2025-03-04 09:55:42,352 INFO L158 Benchmark]: TraceAbstraction took 9884.59ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 93.2MB in the beginning and 687.7MB in the end (delta: -594.5MB). Peak memory consumption was 461.3MB. Max. memory is 16.1GB. [2025-03-04 09:55:42,352 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 1.2GB. Free memory was 687.7MB in the beginning and 687.5MB in the end (delta: 240.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:55:42,353 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.16ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.62ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 81.5MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.80ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 79.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.94ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 76.1MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 573.01ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 93.2MB in the end (delta: -17.1MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9884.59ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 93.2MB in the beginning and 687.7MB in the end (delta: -594.5MB). Peak memory consumption was 461.3MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 1.2GB. Free memory was 687.7MB in the beginning and 687.5MB in the end (delta: 240.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L738] 0 int z = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2073; [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2073=-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] [L833] 0 pthread_t t2074; [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2073=-2, t2074=-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 t2075; [L836] FCALL, FORK 0 pthread_create(&t2075, ((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, main$tmp_guard0=0, main$tmp_guard1=0, t2073=-2, t2074=-1, t2075=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] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 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, 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] [L786] 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, 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] [L803] 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, 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] [L806] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L809] 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) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 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, 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] [L744] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 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) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 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)) [L758] 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)) [L759] 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)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=2] [L789] 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) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 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 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=2] [L796] 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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=2] [L816] 3 __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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=2] [L767] 1 __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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=2] [L838] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=-2, t2074=-1, t2075=0, weak$$choice0=1, 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=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 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 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=-2, t2074=-1, t2075=0, weak$$choice0=1, 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=2] [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=-2, t2074=-1, t2075=0, weak$$choice0=1, 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=2] [L851] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=2] [L18] 0 __assert_fail ("0", "safe013_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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 832]: 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, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 677 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 675 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1651 IncrementalHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 3 mSDtfsCounter, 1651 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=8, InterpolantAutomatonStates: 62, 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.3s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 1024 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-04 09:55:42,370 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/safe013_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 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:55:44,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:55:44,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 09:55:44,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:55:44,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:55:44,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:55:44,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:55:44,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:55:44,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:55:44,476 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:55:44,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:55:44,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:55:44,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:55:44,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:55:44,476 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:55:44,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:55:44,476 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:55:44,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:55:44,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:55:44,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:55:44,478 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:55:44,478 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:55:44,478 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:55:44,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:55:44,478 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:55:44,478 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 09:55:44,478 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 09:55:44,478 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:55:44,478 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:55:44,478 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:55:44,478 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:55:44,478 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:55:44,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:55:44,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:55:44,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:55:44,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:55:44,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:55:44,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:55:44,479 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 09:55:44,479 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 09:55:44,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:55:44,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:55:44,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:55:44,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:55:44,479 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 -> 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 [2025-03-04 09:55:44,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:55:44,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:55:44,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:55:44,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:55:44,715 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:55:44,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:55:45,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07d2297c/cc6dffd52dd7423e8a8a0c9dc16cab8f/FLAG6b76103e6 [2025-03-04 09:55:46,142 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:55:46,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:55:46,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07d2297c/cc6dffd52dd7423e8a8a0c9dc16cab8f/FLAG6b76103e6 [2025-03-04 09:55:46,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07d2297c/cc6dffd52dd7423e8a8a0c9dc16cab8f [2025-03-04 09:55:46,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:55:46,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:55:46,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:55:46,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:55:46,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:55:46,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:55:46" (1/1) ... [2025-03-04 09:55:46,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55287184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46, skipping insertion in model container [2025-03-04 09:55:46,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:55:46" (1/1) ... [2025-03-04 09:55:46,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:55:46,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:55:46,723 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:55:46,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:55:46,809 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:55:46,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46 WrapperNode [2025-03-04 09:55:46,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:55:46,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:55:46,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:55:46,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:55:46,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46" (1/1) ... [2025-03-04 09:55:46,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46" (1/1) ... [2025-03-04 09:55:46,856 INFO L138 Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2025-03-04 09:55:46,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:55:46,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:55:46,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:55:46,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:55:46,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46" (1/1) ... [2025-03-04 09:55:46,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46" (1/1) ... [2025-03-04 09:55:46,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46" (1/1) ... [2025-03-04 09:55:46,884 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-04 09:55:46,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46" (1/1) ... [2025-03-04 09:55:46,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46" (1/1) ... [2025-03-04 09:55:46,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46" (1/1) ... [2025-03-04 09:55:46,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46" (1/1) ... [2025-03-04 09:55:46,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46" (1/1) ... [2025-03-04 09:55:46,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46" (1/1) ... [2025-03-04 09:55:46,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:55:46,903 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:55:46,903 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:55:46,904 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:55:46,904 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46" (1/1) ... [2025-03-04 09:55:46,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:55:46,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:55:46,934 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-04 09:55:46,936 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-04 09:55:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:55:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:55:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 09:55:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:55:46,954 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:55:46,955 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:55:46,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:55:46,955 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:55:46,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:55:46,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:55:46,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:55:46,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:55:46,957 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:55:47,051 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:55:47,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:55:47,296 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:55:47,296 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:55:47,466 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:55:47,467 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:55:47,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:55:47 BoogieIcfgContainer [2025-03-04 09:55:47,467 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:55:47,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:55:47,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:55:47,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:55:47,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:55:46" (1/3) ... [2025-03-04 09:55:47,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e70ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:55:47, skipping insertion in model container [2025-03-04 09:55:47,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:46" (2/3) ... [2025-03-04 09:55:47,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e70ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:55:47, skipping insertion in model container [2025-03-04 09:55:47,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:55:47" (3/3) ... [2025-03-04 09:55:47,475 INFO L128 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:55:47,485 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:55:47,486 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe013_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-04 09:55:47,486 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:55:47,549 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:55:47,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2025-03-04 09:55:47,604 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2025-03-04 09:55:47,608 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:55:47,611 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 81 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-04 09:55:47,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2025-03-04 09:55:47,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2025-03-04 09:55:47,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:55:47,633 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;@1c0d4b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:55:47,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 09:55:47,639 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:55:47,641 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-04 09:55:47,641 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:55:47,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:47,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:55:47,642 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-04 09:55:47,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:47,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1807300723, now seen corresponding path program 1 times [2025-03-04 09:55:47,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:55:47,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [983646113] [2025-03-04 09:55:47,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:47,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:55:47,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:55:47,656 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-04 09:55:47,657 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-04 09:55:47,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:55:47,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:55:47,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:47,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:47,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:55:47,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:55:47,757 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-04 09:55:47,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:55:47,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:55:47,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983646113] [2025-03-04 09:55:47,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983646113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:47,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:47,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:55:47,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125650637] [2025-03-04 09:55:47,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:47,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:55:47,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:55:47,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:55:47,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:55:47,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:55:47,786 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-04 09:55:47,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:47,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:55:47,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:48,681 INFO L124 PetriNetUnfolderBase]: 6263/9057 cut-off events. [2025-03-04 09:55:48,682 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 09:55:48,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18044 conditions, 9057 events. 6263/9057 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 50962 event pairs, 693 based on Foata normal form. 504/9557 useless extension candidates. Maximal degree in co-relation 18033. Up to 7741 conditions per place. [2025-03-04 09:55:48,736 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-03-04 09:55:48,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 238 flow [2025-03-04 09:55:48,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:55:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:55:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-03-04 09:55:48,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2025-03-04 09:55:48,747 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 88 transitions. [2025-03-04 09:55:48,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 238 flow [2025-03-04 09:55:48,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:55:48,753 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2025-03-04 09:55:48,756 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-04 09:55:48,759 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-03-04 09:55:48,759 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2025-03-04 09:55:48,759 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-04 09:55:48,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:48,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:48,767 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-04 09:55:48,960 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-04 09:55:48,960 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-04 09:55:48,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:48,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1074698950, now seen corresponding path program 1 times [2025-03-04 09:55:48,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:55:48,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114749938] [2025-03-04 09:55:48,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:48,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:55:48,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:55:48,964 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-04 09:55:48,967 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-04 09:55:49,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:55:49,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:55:49,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:49,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:49,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 09:55:49,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:55:49,056 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-04 09:55:49,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:55:49,057 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:55:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114749938] [2025-03-04 09:55:49,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114749938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:49,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:49,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:55:49,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640300247] [2025-03-04 09:55:49,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:49,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:55:49,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:55:49,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:55:49,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:55:49,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:55:49,060 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-04 09:55:49,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:49,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:55:49,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:49,674 INFO L124 PetriNetUnfolderBase]: 5627/8761 cut-off events. [2025-03-04 09:55:49,674 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-03-04 09:55:49,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17251 conditions, 8761 events. 5627/8761 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 52712 event pairs, 5627 based on Foata normal form. 252/9008 useless extension candidates. Maximal degree in co-relation 17241. Up to 7994 conditions per place. [2025-03-04 09:55:49,718 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 28 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2025-03-04 09:55:49,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 142 flow [2025-03-04 09:55:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:55:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:55:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-04 09:55:49,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2025-03-04 09:55:49,721 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 58 transitions. [2025-03-04 09:55:49,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 142 flow [2025-03-04 09:55:49,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:55:49,724 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2025-03-04 09:55:49,724 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-04 09:55:49,725 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-03-04 09:55:49,725 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2025-03-04 09:55:49,725 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-04 09:55:49,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:49,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:49,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:55:49,925 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-04 09:55:49,926 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-04 09:55:49,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:49,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1074698494, now seen corresponding path program 1 times [2025-03-04 09:55:49,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:55:49,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133159918] [2025-03-04 09:55:49,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:49,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:55:49,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:55:49,928 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-04 09:55:49,930 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-04 09:55:49,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:55:49,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:55:49,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:49,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:49,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:55:49,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:55:50,020 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-04 09:55:50,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:55:50,020 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:55:50,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133159918] [2025-03-04 09:55:50,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133159918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:50,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:50,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:55:50,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742674878] [2025-03-04 09:55:50,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:50,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:55:50,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:55:50,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:55:50,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:55:50,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:55:50,022 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-04 09:55:50,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:50,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:55:50,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:50,491 INFO L124 PetriNetUnfolderBase]: 4015/6429 cut-off events. [2025-03-04 09:55:50,491 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:55:50,500 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 38377 event pairs, 661 based on Foata normal form. 252/6676 useless extension candidates. Maximal degree in co-relation 12429. Up to 3409 conditions per place. [2025-03-04 09:55:50,521 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 58 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2025-03-04 09:55:50,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 280 flow [2025-03-04 09:55:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:55:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:55:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-04 09:55:50,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-03-04 09:55:50,523 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 106 transitions. [2025-03-04 09:55:50,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 280 flow [2025-03-04 09:55:50,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:55:50,525 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow [2025-03-04 09:55:50,525 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-04 09:55:50,525 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2025-03-04 09:55:50,525 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow [2025-03-04 09:55:50,526 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-04 09:55:50,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:50,526 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-04 09:55:50,534 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-04 09:55:50,726 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-04 09:55:50,726 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-04 09:55:50,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:50,727 INFO L85 PathProgramCache]: Analyzing trace with hash -211595293, now seen corresponding path program 1 times [2025-03-04 09:55:50,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:55:50,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [555863462] [2025-03-04 09:55:50,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:50,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:55:50,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:55:50,729 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-04 09:55:50,731 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-04 09:55:50,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:55:50,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:55:50,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:50,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:50,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:55:50,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:55:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:55:50,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:55:50,838 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:55:50,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555863462] [2025-03-04 09:55:50,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555863462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:50,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:50,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:55:50,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702784457] [2025-03-04 09:55:50,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:50,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:55:50,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:55:50,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:55:50,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:55:50,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:55:50,839 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-04 09:55:50,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:50,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:55:50,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:51,187 INFO L124 PetriNetUnfolderBase]: 2207/3533 cut-off events. [2025-03-04 09:55:51,187 INFO L125 PetriNetUnfolderBase]: For 658/658 co-relation queries the response was YES. [2025-03-04 09:55:51,192 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 18144 event pairs, 427 based on Foata normal form. 172/3700 useless extension candidates. Maximal degree in co-relation 7973. Up to 1128 conditions per place. [2025-03-04 09:55:51,199 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 74 selfloop transitions, 8 changer transitions 1/89 dead transitions. [2025-03-04 09:55:51,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 89 transitions, 400 flow [2025-03-04 09:55:51,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:55:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:55:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-04 09:55:51,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 09:55:51,203 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 135 transitions. [2025-03-04 09:55:51,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 89 transitions, 400 flow [2025-03-04 09:55:51,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 89 transitions, 390 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 09:55:51,206 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow [2025-03-04 09:55:51,206 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-04 09:55:51,209 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-03-04 09:55:51,209 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow [2025-03-04 09:55:51,209 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-04 09:55:51,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:51,209 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-04 09:55:51,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:55:51,409 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-04 09:55:51,410 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-04 09:55:51,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1546030343, now seen corresponding path program 1 times [2025-03-04 09:55:51,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:55:51,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [407546302] [2025-03-04 09:55:51,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:51,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:55:51,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:55:51,413 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-04 09:55:51,414 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-04 09:55:51,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:55:51,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:55:51,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:51,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:51,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:55:51,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:55:51,516 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-04 09:55:51,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:55:51,517 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:55:51,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407546302] [2025-03-04 09:55:51,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407546302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:51,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:51,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:55:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974663865] [2025-03-04 09:55:51,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:51,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:55:51,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:55:51,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:55:51,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:55:51,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:55:51,518 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-04 09:55:51,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:51,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:55:51,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:51,813 INFO L124 PetriNetUnfolderBase]: 1355/2101 cut-off events. [2025-03-04 09:55:51,814 INFO L125 PetriNetUnfolderBase]: For 1232/1232 co-relation queries the response was YES. [2025-03-04 09:55:51,817 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 9410 event pairs, 385 based on Foata normal form. 60/2156 useless extension candidates. Maximal degree in co-relation 5213. Up to 788 conditions per place. [2025-03-04 09:55:51,822 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 62 selfloop transitions, 11 changer transitions 1/80 dead transitions. [2025-03-04 09:55:51,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 387 flow [2025-03-04 09:55:51,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:55:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:55:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-03-04 09:55:51,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2025-03-04 09:55:51,823 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 136 transitions. [2025-03-04 09:55:51,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 387 flow [2025-03-04 09:55:51,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 362 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 09:55:51,836 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow [2025-03-04 09:55:51,836 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-04 09:55:51,838 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-03-04 09:55:51,838 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow [2025-03-04 09:55:51,838 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-04 09:55:51,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:51,839 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-04 09:55:51,845 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-04 09:55:52,041 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-04 09:55:52,041 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-04 09:55:52,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:52,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1478925176, now seen corresponding path program 1 times [2025-03-04 09:55:52,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:55:52,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1664401891] [2025-03-04 09:55:52,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:52,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:55:52,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:55:52,044 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-04 09:55:52,046 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-04 09:55:52,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:55:52,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:55:52,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:52,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:52,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 09:55:52,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:55:52,260 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-04 09:55:52,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:55:52,261 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:55:52,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664401891] [2025-03-04 09:55:52,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664401891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:52,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:52,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:55:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819822723] [2025-03-04 09:55:52,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:52,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:55:52,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:55:52,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:55:52,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:55:52,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:55:52,270 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-04 09:55:52,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:52,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:55:52,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:52,653 INFO L124 PetriNetUnfolderBase]: 1913/2967 cut-off events. [2025-03-04 09:55:52,653 INFO L125 PetriNetUnfolderBase]: For 1942/1942 co-relation queries the response was YES. [2025-03-04 09:55:52,659 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 14268 event pairs, 303 based on Foata normal form. 8/2970 useless extension candidates. Maximal degree in co-relation 7459. Up to 1224 conditions per place. [2025-03-04 09:55:52,663 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 63 selfloop transitions, 7 changer transitions 25/101 dead transitions. [2025-03-04 09:55:52,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 101 transitions, 565 flow [2025-03-04 09:55:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:55:52,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:55:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2025-03-04 09:55:52,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4984126984126984 [2025-03-04 09:55:52,665 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 7 states and 157 transitions. [2025-03-04 09:55:52,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 101 transitions, 565 flow [2025-03-04 09:55:52,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 101 transitions, 448 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-04 09:55:52,676 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 166 flow [2025-03-04 09:55:52,677 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-04 09:55:52,677 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2025-03-04 09:55:52,677 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 166 flow [2025-03-04 09:55:52,678 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-04 09:55:52,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:52,678 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-04 09:55:52,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 09:55:52,878 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-04 09:55:52,879 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-04 09:55:52,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2008934026, now seen corresponding path program 2 times [2025-03-04 09:55:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:55:52,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1369543173] [2025-03-04 09:55:52,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:55:52,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:55:52,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:55:52,885 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-04 09:55:52,887 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-04 09:55:52,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:55:52,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:55:52,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:55:52,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:52,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 09:55:52,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:55:53,018 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-04 09:55:53,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:55:53,018 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:55:53,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369543173] [2025-03-04 09:55:53,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369543173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:53,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:53,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:55:53,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364056325] [2025-03-04 09:55:53,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:53,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:55:53,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:55:53,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:55:53,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:55:53,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:55:53,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:55:53,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:53,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:55:53,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:53,342 INFO L124 PetriNetUnfolderBase]: 1409/2235 cut-off events. [2025-03-04 09:55:53,342 INFO L125 PetriNetUnfolderBase]: For 664/664 co-relation queries the response was YES. [2025-03-04 09:55:53,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5344 conditions, 2235 events. 1409/2235 cut-off events. For 664/664 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10224 event pairs, 623 based on Foata normal form. 8/2240 useless extension candidates. Maximal degree in co-relation 5331. Up to 1333 conditions per place. [2025-03-04 09:55:53,352 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 44 selfloop transitions, 2 changer transitions 29/81 dead transitions. [2025-03-04 09:55:53,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 419 flow [2025-03-04 09:55:53,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:55:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:55:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-03-04 09:55:53,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2025-03-04 09:55:53,358 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 166 flow. Second operand 6 states and 119 transitions. [2025-03-04 09:55:53,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 419 flow [2025-03-04 09:55:53,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 405 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 09:55:53,361 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 152 flow [2025-03-04 09:55:53,361 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2025-03-04 09:55:53,362 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2025-03-04 09:55:53,362 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 152 flow [2025-03-04 09:55:53,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:55:53,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:53,362 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-04 09:55:53,369 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-04 09:55:53,562 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-04 09:55:53,563 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-04 09:55:53,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:53,565 INFO L85 PathProgramCache]: Analyzing trace with hash 252848482, now seen corresponding path program 3 times [2025-03-04 09:55:53,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:55:53,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585794614] [2025-03-04 09:55:53,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:55:53,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:55:53,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:55:53,567 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-04 09:55:53,569 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-04 09:55:53,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:55:53,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:55:53,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:55:53,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:53,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 09:55:53,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:55:54,010 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-04 09:55:54,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:55:54,010 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:55:54,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585794614] [2025-03-04 09:55:54,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585794614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:54,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:54,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:55:54,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056423566] [2025-03-04 09:55:54,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:54,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:55:54,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:55:54,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:55:54,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:55:54,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:55:54,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 152 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-04 09:55:54,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:54,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:55:54,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:54,422 INFO L124 PetriNetUnfolderBase]: 741/1219 cut-off events. [2025-03-04 09:55:54,422 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2025-03-04 09:55:54,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2908 conditions, 1219 events. 741/1219 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4829 event pairs, 138 based on Foata normal form. 8/1226 useless extension candidates. Maximal degree in co-relation 2893. Up to 580 conditions per place. [2025-03-04 09:55:54,428 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 46 selfloop transitions, 4 changer transitions 41/97 dead transitions. [2025-03-04 09:55:54,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 97 transitions, 502 flow [2025-03-04 09:55:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:55:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:55:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2025-03-04 09:55:54,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39111111111111113 [2025-03-04 09:55:54,431 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 152 flow. Second operand 10 states and 176 transitions. [2025-03-04 09:55:54,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 97 transitions, 502 flow [2025-03-04 09:55:54,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 460 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-03-04 09:55:54,435 INFO L231 Difference]: Finished difference. Result has 65 places, 41 transitions, 139 flow [2025-03-04 09:55:54,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=139, PETRI_PLACES=65, PETRI_TRANSITIONS=41} [2025-03-04 09:55:54,436 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2025-03-04 09:55:54,436 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 139 flow [2025-03-04 09:55:54,436 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-04 09:55:54,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:54,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:54,444 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-04 09:55:54,636 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-04 09:55:54,637 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-04 09:55:54,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:54,637 INFO L85 PathProgramCache]: Analyzing trace with hash -293508602, now seen corresponding path program 4 times [2025-03-04 09:55:54,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:55:54,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2077160907] [2025-03-04 09:55:54,638 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 09:55:54,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:55:54,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:55:54,640 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-04 09:55:54,640 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-04 09:55:54,692 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 09:55:54,712 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:55:54,713 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 09:55:54,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:55:54,713 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:55:54,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:55:54,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:55:54,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:54,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:55:54,790 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 09:55:54,790 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:55:54,791 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-04 09:55:54,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-04 09:55:54,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-04 09:55:54,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 09:55:54,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-04 09:55:54,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-04 09:55:54,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 09:55:54,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 09:55:54,993 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-04 09:55:54,994 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2025-03-04 09:55:55,058 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:55:55,058 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:55:55,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:55:55 BasicIcfg [2025-03-04 09:55:55,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:55:55,064 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:55:55,064 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:55:55,064 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:55:55,065 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:55:47" (3/4) ... [2025-03-04 09:55:55,066 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 09:55:55,066 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:55:55,068 INFO L158 Benchmark]: Toolchain (without parser) took 8609.29ms. Allocated memory was 117.4MB in the beginning and 780.1MB in the end (delta: 662.7MB). Free memory was 90.9MB in the beginning and 262.5MB in the end (delta: -171.6MB). Peak memory consumption was 495.8MB. Max. memory is 16.1GB. [2025-03-04 09:55:55,068 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:55:55,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.63ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 68.0MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:55:55,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.28ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 65.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:55:55,069 INFO L158 Benchmark]: Boogie Preprocessor took 42.97ms. 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-04 09:55:55,069 INFO L158 Benchmark]: IcfgBuilder took 563.61ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 49.2MB in the end (delta: 13.6MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2025-03-04 09:55:55,070 INFO L158 Benchmark]: TraceAbstraction took 7595.23ms. Allocated memory was 117.4MB in the beginning and 780.1MB in the end (delta: 662.7MB). Free memory was 49.0MB in the beginning and 262.5MB in the end (delta: -213.5MB). Peak memory consumption was 457.6MB. Max. memory is 16.1GB. [2025-03-04 09:55:55,070 INFO L158 Benchmark]: Witness Printer took 2.17ms. Allocated memory is still 780.1MB. Free memory was 262.5MB in the beginning and 262.5MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:55:55,071 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.31ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.63ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 68.0MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.28ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 65.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.97ms. 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 563.61ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 49.2MB in the end (delta: 13.6MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7595.23ms. Allocated memory was 117.4MB in the beginning and 780.1MB in the end (delta: 662.7MB). Free memory was 49.0MB in the beginning and 262.5MB in the end (delta: -213.5MB). Peak memory consumption was 457.6MB. Max. memory is 16.1GB. * Witness Printer took 2.17ms. Allocated memory is still 780.1MB. Free memory was 262.5MB in the beginning and 262.5MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L738] 0 int z = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2073; [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2073=254, 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] [L833] 0 pthread_t t2074; [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073=254, t2074=255, 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 t2075; [L836] FCALL, FORK 0 pthread_create(&t2075, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073=254, t2074=255, t2075=256, 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] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 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, 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] [L786] 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, 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] [L803] 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, 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] [L806] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L809] 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) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 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, 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] [L744] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 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) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 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)) [L758] 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)) [L759] 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)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 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, 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=2] [L789] 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) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 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 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 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, 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=2] [L796] 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, 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=2] [L816] 3 __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, 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=2] [L767] 1 __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, 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=2] [L838] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=254, t2074=255, t2075=256, 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=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 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 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=254, t2074=255, t2075=256, 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=2] [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=254, t2074=255, t2075=256, 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=2] [L851] 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, 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=2] [L18] 0 __assert_fail ("0", "safe013_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, 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=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 832]: 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, 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.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 488 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 481 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1362 IncrementalHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 3 mSDtfsCounter, 1362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=6, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 752 SizeOfPredicates, 22 NumberOfNonLiveVariables, 807 ConjunctsInSsa, 54 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-04 09:55:55,084 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