./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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/safe004_power.opt_pso.opt_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 ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:10:41,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:10:41,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:10:41,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:10:41,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:10:41,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:10:41,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:10:41,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:10:41,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:10:41,285 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:10:41,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:10:41,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:10:41,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:10:41,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:10:41,286 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:10:41,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:10:41,287 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:10:41,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:10:41,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:10:41,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:10:41,287 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:10:41,287 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:10:41,287 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:10:41,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:10:41,287 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:10:41,287 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:10:41,287 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:10:41,287 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:10:41,287 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:10:41,288 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:10:41,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:10:41,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:10:41,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:10:41,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:10:41,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:10:41,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:10:41,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:10:41,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:10:41,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:10:41,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:10:41,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:10:41,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:10:41,289 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 -> ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 [2025-03-17 14:10:41,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:10:41,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:10:41,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:10:41,524 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:10:41,524 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:10:41,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2025-03-17 14:10:42,658 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/944389ec9/0af8a8b628e74c37a6b9a59b0dd8dd44/FLAG53b13db2b [2025-03-17 14:10:42,951 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:10:42,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2025-03-17 14:10:42,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/944389ec9/0af8a8b628e74c37a6b9a59b0dd8dd44/FLAG53b13db2b [2025-03-17 14:10:43,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/944389ec9/0af8a8b628e74c37a6b9a59b0dd8dd44 [2025-03-17 14:10:43,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:10:43,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:10:43,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:10:43,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:10:43,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:10:43,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:10:43" (1/1) ... [2025-03-17 14:10:43,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf098e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43, skipping insertion in model container [2025-03-17 14:10:43,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:10:43" (1/1) ... [2025-03-17 14:10:43,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:10:43,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:10:43,526 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:10:43,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:10:43,612 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:10:43,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43 WrapperNode [2025-03-17 14:10:43,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:10:43,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:10:43,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:10:43,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:10:43,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43" (1/1) ... [2025-03-17 14:10:43,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43" (1/1) ... [2025-03-17 14:10:43,654 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2025-03-17 14:10:43,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:10:43,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:10:43,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:10:43,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:10:43,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43" (1/1) ... [2025-03-17 14:10:43,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43" (1/1) ... [2025-03-17 14:10:43,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43" (1/1) ... [2025-03-17 14:10:43,674 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-17 14:10:43,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43" (1/1) ... [2025-03-17 14:10:43,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43" (1/1) ... [2025-03-17 14:10:43,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43" (1/1) ... [2025-03-17 14:10:43,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43" (1/1) ... [2025-03-17 14:10:43,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43" (1/1) ... [2025-03-17 14:10:43,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43" (1/1) ... [2025-03-17 14:10:43,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:10:43,696 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:10:43,696 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:10:43,696 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:10:43,697 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43" (1/1) ... [2025-03-17 14:10:43,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:10:43,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:10:43,725 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-17 14:10:43,728 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-17 14:10:43,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:10:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:10:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 14:10:43,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 14:10:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 14:10:43,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 14:10:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-17 14:10:43,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-17 14:10:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:10:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:10:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:10:43,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:10:43,749 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:10:43,850 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:10:43,852 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:10:44,098 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:10:44,098 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:10:44,261 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:10:44,261 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:10:44,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:10:44 BoogieIcfgContainer [2025-03-17 14:10:44,261 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:10:44,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:10:44,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:10:44,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:10:44,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:10:43" (1/3) ... [2025-03-17 14:10:44,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3a35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:10:44, skipping insertion in model container [2025-03-17 14:10:44,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:43" (2/3) ... [2025-03-17 14:10:44,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3a35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:10:44, skipping insertion in model container [2025-03-17 14:10:44,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:10:44" (3/3) ... [2025-03-17 14:10:44,267 INFO L128 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2025-03-17 14:10:44,279 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:10:44,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe004_power.opt_pso.opt_rmo.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-17 14:10:44,281 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:10:44,325 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:10:44,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2025-03-17 14:10:44,381 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2025-03-17 14:10:44,383 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:10:44,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-03-17 14:10:44,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2025-03-17 14:10:44,391 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2025-03-17 14:10:44,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:10:44,413 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;@4dfd150a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:10:44,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 14:10:44,418 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:10:44,418 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-17 14:10:44,418 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:10:44,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:44,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:10:44,420 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-17 14:10:44,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:44,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1897631007, now seen corresponding path program 1 times [2025-03-17 14:10:44,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:44,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574890472] [2025-03-17 14:10:44,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:44,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:44,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:10:44,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:10:44,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:44,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:44,780 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-17 14:10:44,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:44,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574890472] [2025-03-17 14:10:44,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574890472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:44,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:44,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:10:44,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314631517] [2025-03-17 14:10:44,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:44,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:10:44,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:44,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:10:44,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:10:44,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:44,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 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-17 14:10:44,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:44,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:44,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:45,755 INFO L124 PetriNetUnfolderBase]: 5315/7699 cut-off events. [2025-03-17 14:10:45,755 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-17 14:10:45,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15350 conditions, 7699 events. 5315/7699 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 42906 event pairs, 585 based on Foata normal form. 432/8119 useless extension candidates. Maximal degree in co-relation 15339. Up to 6591 conditions per place. [2025-03-17 14:10:45,789 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 47 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2025-03-17 14:10:45,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 230 flow [2025-03-17 14:10:45,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:10:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:10:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-17 14:10:45,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-03-17 14:10:45,800 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 86 transitions. [2025-03-17 14:10:45,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 230 flow [2025-03-17 14:10:45,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:10:45,806 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2025-03-17 14:10:45,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-03-17 14:10:45,811 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2025-03-17 14:10:45,811 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2025-03-17 14:10:45,812 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-17 14:10:45,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:45,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:45,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:10:45,813 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-17 14:10:45,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash -651707563, now seen corresponding path program 1 times [2025-03-17 14:10:45,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:45,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046436646] [2025-03-17 14:10:45,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:45,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:45,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:10:45,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:10:45,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:45,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:45,939 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-17 14:10:45,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:45,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046436646] [2025-03-17 14:10:45,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046436646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:45,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:45,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:10:45,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872131255] [2025-03-17 14:10:45,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:45,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:10:45,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:45,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:10:45,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:10:45,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:45,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 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-17 14:10:45,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:45,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:45,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:46,432 INFO L124 PetriNetUnfolderBase]: 4775/7427 cut-off events. [2025-03-17 14:10:46,433 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2025-03-17 14:10:46,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14657 conditions, 7427 events. 4775/7427 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 43908 event pairs, 4775 based on Foata normal form. 216/7592 useless extension candidates. Maximal degree in co-relation 14647. Up to 6804 conditions per place. [2025-03-17 14:10:46,462 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-03-17 14:10:46,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 138 flow [2025-03-17 14:10:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:10:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:10:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-03-17 14:10:46,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-03-17 14:10:46,465 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 57 transitions. [2025-03-17 14:10:46,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 138 flow [2025-03-17 14:10:46,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:10:46,467 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2025-03-17 14:10:46,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-03-17 14:10:46,469 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2025-03-17 14:10:46,469 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2025-03-17 14:10:46,469 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-17 14:10:46,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:46,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:46,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:10:46,469 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-17 14:10:46,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:46,471 INFO L85 PathProgramCache]: Analyzing trace with hash -651707251, now seen corresponding path program 1 times [2025-03-17 14:10:46,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637575160] [2025-03-17 14:10:46,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:46,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:46,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:10:46,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:10:46,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:46,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:46,765 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-17 14:10:46,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:46,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637575160] [2025-03-17 14:10:46,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637575160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:46,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:46,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:10:46,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142924669] [2025-03-17 14:10:46,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:46,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:10:46,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:46,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:10:46,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:10:46,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:46,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 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-17 14:10:46,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:46,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:46,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:47,628 INFO L124 PetriNetUnfolderBase]: 5831/8735 cut-off events. [2025-03-17 14:10:47,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:10:47,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17189 conditions, 8735 events. 5831/8735 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 49132 event pairs, 827 based on Foata normal form. 0/8540 useless extension candidates. Maximal degree in co-relation 17183. Up to 4993 conditions per place. [2025-03-17 14:10:47,662 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 40 selfloop transitions, 2 changer transitions 70/117 dead transitions. [2025-03-17 14:10:47,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 117 transitions, 466 flow [2025-03-17 14:10:47,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:10:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:10:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2025-03-17 14:10:47,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5284090909090909 [2025-03-17 14:10:47,666 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 8 states and 186 transitions. [2025-03-17 14:10:47,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 117 transitions, 466 flow [2025-03-17 14:10:47,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 117 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:10:47,671 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 89 flow [2025-03-17 14:10:47,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=89, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2025-03-17 14:10:47,672 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2025-03-17 14:10:47,673 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 89 flow [2025-03-17 14:10:47,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:47,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:47,673 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:47,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:10:47,673 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-17 14:10:47,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:47,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1705311444, now seen corresponding path program 1 times [2025-03-17 14:10:47,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:47,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282365391] [2025-03-17 14:10:47,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:47,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:47,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:10:47,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:10:47,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:47,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:47,877 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-17 14:10:47,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:47,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282365391] [2025-03-17 14:10:47,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282365391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:47,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:47,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:10:47,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381170583] [2025-03-17 14:10:47,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:47,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:10:47,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:47,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:10:47,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:10:47,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:47,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 89 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-17 14:10:47,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:47,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:47,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:48,616 INFO L124 PetriNetUnfolderBase]: 6661/9890 cut-off events. [2025-03-17 14:10:48,616 INFO L125 PetriNetUnfolderBase]: For 1192/1192 co-relation queries the response was YES. [2025-03-17 14:10:48,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21282 conditions, 9890 events. 6661/9890 cut-off events. For 1192/1192 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 57485 event pairs, 991 based on Foata normal form. 180/10068 useless extension candidates. Maximal degree in co-relation 21270. Up to 4689 conditions per place. [2025-03-17 14:10:48,642 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 49 selfloop transitions, 4 changer transitions 55/113 dead transitions. [2025-03-17 14:10:48,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 113 transitions, 484 flow [2025-03-17 14:10:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:10:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:10:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2025-03-17 14:10:48,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5170454545454546 [2025-03-17 14:10:48,644 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 89 flow. Second operand 8 states and 182 transitions. [2025-03-17 14:10:48,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 113 transitions, 484 flow [2025-03-17 14:10:48,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 113 transitions, 462 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-17 14:10:48,734 INFO L231 Difference]: Finished difference. Result has 55 places, 35 transitions, 119 flow [2025-03-17 14:10:48,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=119, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2025-03-17 14:10:48,735 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2025-03-17 14:10:48,735 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 35 transitions, 119 flow [2025-03-17 14:10:48,735 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-17 14:10:48,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:48,736 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-17 14:10:48,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:10:48,736 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-17 14:10:48,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:48,737 INFO L85 PathProgramCache]: Analyzing trace with hash 408637837, now seen corresponding path program 1 times [2025-03-17 14:10:48,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:48,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597184336] [2025-03-17 14:10:48,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:48,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:48,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:10:48,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:10:48,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:48,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:49,136 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-17 14:10:49,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:49,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597184336] [2025-03-17 14:10:49,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597184336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:49,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:49,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:10:49,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871699208] [2025-03-17 14:10:49,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:49,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:10:49,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:49,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:10:49,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:10:49,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:49,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 35 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:49,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:49,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:49,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:50,518 INFO L124 PetriNetUnfolderBase]: 9327/13878 cut-off events. [2025-03-17 14:10:50,519 INFO L125 PetriNetUnfolderBase]: For 8111/8111 co-relation queries the response was YES. [2025-03-17 14:10:50,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33697 conditions, 13878 events. 9327/13878 cut-off events. For 8111/8111 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 83528 event pairs, 1598 based on Foata normal form. 383/14255 useless extension candidates. Maximal degree in co-relation 33683. Up to 4737 conditions per place. [2025-03-17 14:10:50,587 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 72 selfloop transitions, 22 changer transitions 102/201 dead transitions. [2025-03-17 14:10:50,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 201 transitions, 979 flow [2025-03-17 14:10:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:10:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 14:10:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 315 transitions. [2025-03-17 14:10:50,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5506993006993007 [2025-03-17 14:10:50,591 INFO L175 Difference]: Start difference. First operand has 55 places, 35 transitions, 119 flow. Second operand 13 states and 315 transitions. [2025-03-17 14:10:50,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 201 transitions, 979 flow [2025-03-17 14:10:50,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 201 transitions, 937 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-03-17 14:10:50,703 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 331 flow [2025-03-17 14:10:50,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=331, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2025-03-17 14:10:50,705 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2025-03-17 14:10:50,706 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 331 flow [2025-03-17 14:10:50,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:50,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:50,707 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-17 14:10:50,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:10:50,707 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-17 14:10:50,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:50,710 INFO L85 PathProgramCache]: Analyzing trace with hash -916437939, now seen corresponding path program 2 times [2025-03-17 14:10:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:50,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822752836] [2025-03-17 14:10:50,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:10:50,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:50,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:10:50,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:10:50,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:10:50,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:51,043 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-17 14:10:51,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:51,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822752836] [2025-03-17 14:10:51,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822752836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:51,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:51,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:10:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058641844] [2025-03-17 14:10:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:51,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:10:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:51,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:10:51,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:10:51,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:51,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 52 transitions, 331 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-17 14:10:51,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:51,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:51,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:52,872 INFO L124 PetriNetUnfolderBase]: 11191/16459 cut-off events. [2025-03-17 14:10:52,873 INFO L125 PetriNetUnfolderBase]: For 64079/64079 co-relation queries the response was YES. [2025-03-17 14:10:52,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63386 conditions, 16459 events. 11191/16459 cut-off events. For 64079/64079 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 97869 event pairs, 1441 based on Foata normal form. 320/16773 useless extension candidates. Maximal degree in co-relation 63362. Up to 4243 conditions per place. [2025-03-17 14:10:52,934 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 69 selfloop transitions, 19 changer transitions 115/208 dead transitions. [2025-03-17 14:10:52,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 208 transitions, 1665 flow [2025-03-17 14:10:52,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:10:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:10:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 272 transitions. [2025-03-17 14:10:52,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5619834710743802 [2025-03-17 14:10:52,935 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 331 flow. Second operand 11 states and 272 transitions. [2025-03-17 14:10:52,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 208 transitions, 1665 flow [2025-03-17 14:10:52,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 208 transitions, 1489 flow, removed 88 selfloop flow, removed 4 redundant places. [2025-03-17 14:10:52,988 INFO L231 Difference]: Finished difference. Result has 75 places, 49 transitions, 329 flow [2025-03-17 14:10:52,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=329, PETRI_PLACES=75, PETRI_TRANSITIONS=49} [2025-03-17 14:10:52,989 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2025-03-17 14:10:52,989 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 49 transitions, 329 flow [2025-03-17 14:10:52,989 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-17 14:10:52,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:52,989 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-17 14:10:52,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:10:52,989 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-17 14:10:52,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1642860518, now seen corresponding path program 1 times [2025-03-17 14:10:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:52,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940187651] [2025-03-17 14:10:52,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:52,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:10:53,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:10:53,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:53,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:53,347 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-17 14:10:53,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:53,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940187651] [2025-03-17 14:10:53,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940187651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:53,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:53,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:10:53,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978765827] [2025-03-17 14:10:53,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:53,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:10:53,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:53,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:10:53,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:10:53,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:53,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 49 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:53,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:53,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:53,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:54,224 INFO L124 PetriNetUnfolderBase]: 5847/8783 cut-off events. [2025-03-17 14:10:54,224 INFO L125 PetriNetUnfolderBase]: For 28435/28435 co-relation queries the response was YES. [2025-03-17 14:10:54,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32741 conditions, 8783 events. 5847/8783 cut-off events. For 28435/28435 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 48174 event pairs, 1177 based on Foata normal form. 264/9047 useless extension candidates. Maximal degree in co-relation 32713. Up to 3370 conditions per place. [2025-03-17 14:10:54,255 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 54 selfloop transitions, 11 changer transitions 84/154 dead transitions. [2025-03-17 14:10:54,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 154 transitions, 1179 flow [2025-03-17 14:10:54,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:10:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:10:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 225 transitions. [2025-03-17 14:10:54,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-03-17 14:10:54,256 INFO L175 Difference]: Start difference. First operand has 75 places, 49 transitions, 329 flow. Second operand 10 states and 225 transitions. [2025-03-17 14:10:54,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 154 transitions, 1179 flow [2025-03-17 14:10:54,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 154 transitions, 1035 flow, removed 32 selfloop flow, removed 10 redundant places. [2025-03-17 14:10:54,330 INFO L231 Difference]: Finished difference. Result has 76 places, 46 transitions, 292 flow [2025-03-17 14:10:54,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=292, PETRI_PLACES=76, PETRI_TRANSITIONS=46} [2025-03-17 14:10:54,331 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2025-03-17 14:10:54,331 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 46 transitions, 292 flow [2025-03-17 14:10:54,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:54,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:54,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:54,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:10:54,331 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-17 14:10:54,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:54,332 INFO L85 PathProgramCache]: Analyzing trace with hash 860550793, now seen corresponding path program 1 times [2025-03-17 14:10:54,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:54,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197163923] [2025-03-17 14:10:54,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:54,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:54,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:10:54,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:10:54,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:54,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:54,609 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-17 14:10:54,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:54,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197163923] [2025-03-17 14:10:54,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197163923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:54,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:54,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:10:54,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404068463] [2025-03-17 14:10:54,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:54,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:10:54,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:54,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:10:54,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:10:54,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:54,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 46 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-17 14:10:54,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:54,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:54,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:55,186 INFO L124 PetriNetUnfolderBase]: 2914/4472 cut-off events. [2025-03-17 14:10:55,187 INFO L125 PetriNetUnfolderBase]: For 14753/14758 co-relation queries the response was YES. [2025-03-17 14:10:55,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16494 conditions, 4472 events. 2914/4472 cut-off events. For 14753/14758 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 21779 event pairs, 502 based on Foata normal form. 119/4591 useless extension candidates. Maximal degree in co-relation 16464. Up to 2495 conditions per place. [2025-03-17 14:10:55,204 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 52 selfloop transitions, 12 changer transitions 56/125 dead transitions. [2025-03-17 14:10:55,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 125 transitions, 918 flow [2025-03-17 14:10:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:10:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:10:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions. [2025-03-17 14:10:55,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4590909090909091 [2025-03-17 14:10:55,205 INFO L175 Difference]: Start difference. First operand has 76 places, 46 transitions, 292 flow. Second operand 10 states and 202 transitions. [2025-03-17 14:10:55,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 125 transitions, 918 flow [2025-03-17 14:10:55,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 125 transitions, 829 flow, removed 33 selfloop flow, removed 12 redundant places. [2025-03-17 14:10:55,227 INFO L231 Difference]: Finished difference. Result has 75 places, 49 transitions, 326 flow [2025-03-17 14:10:55,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=326, PETRI_PLACES=75, PETRI_TRANSITIONS=49} [2025-03-17 14:10:55,227 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2025-03-17 14:10:55,227 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 49 transitions, 326 flow [2025-03-17 14:10:55,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-17 14:10:55,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:55,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:55,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:10:55,228 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-17 14:10:55,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:55,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1501450027, now seen corresponding path program 1 times [2025-03-17 14:10:55,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:55,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575099081] [2025-03-17 14:10:55,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:55,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:55,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:10:55,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:10:55,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:55,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:55,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:55,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575099081] [2025-03-17 14:10:55,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575099081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:55,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:55,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:10:55,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343299397] [2025-03-17 14:10:55,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:55,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:10:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:55,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:10:55,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:10:55,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:55,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 49 transitions, 326 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-17 14:10:55,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:55,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:55,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:56,030 INFO L124 PetriNetUnfolderBase]: 3636/5510 cut-off events. [2025-03-17 14:10:56,031 INFO L125 PetriNetUnfolderBase]: For 14287/14287 co-relation queries the response was YES. [2025-03-17 14:10:56,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19456 conditions, 5510 events. 3636/5510 cut-off events. For 14287/14287 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 27884 event pairs, 271 based on Foata normal form. 80/5589 useless extension candidates. Maximal degree in co-relation 19428. Up to 2765 conditions per place. [2025-03-17 14:10:56,051 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 42 selfloop transitions, 13 changer transitions 44/104 dead transitions. [2025-03-17 14:10:56,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 104 transitions, 754 flow [2025-03-17 14:10:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:10:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:10:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2025-03-17 14:10:56,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5032467532467533 [2025-03-17 14:10:56,055 INFO L175 Difference]: Start difference. First operand has 75 places, 49 transitions, 326 flow. Second operand 7 states and 155 transitions. [2025-03-17 14:10:56,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 104 transitions, 754 flow [2025-03-17 14:10:56,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 104 transitions, 710 flow, removed 13 selfloop flow, removed 10 redundant places. [2025-03-17 14:10:56,089 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 263 flow [2025-03-17 14:10:56,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2025-03-17 14:10:56,089 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2025-03-17 14:10:56,089 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 263 flow [2025-03-17 14:10:56,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-17 14:10:56,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:56,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:56,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:10:56,090 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-17 14:10:56,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash -300252357, now seen corresponding path program 2 times [2025-03-17 14:10:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:56,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879132164] [2025-03-17 14:10:56,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:10:56,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:56,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:10:56,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:10:56,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:10:56,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:56,455 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-17 14:10:56,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:56,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879132164] [2025-03-17 14:10:56,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879132164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:56,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:56,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:10:56,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354305394] [2025-03-17 14:10:56,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:56,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:10:56,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:56,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:10:56,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:10:56,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:56,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-17 14:10:56,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:56,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:56,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:56,998 INFO L124 PetriNetUnfolderBase]: 2280/3606 cut-off events. [2025-03-17 14:10:56,998 INFO L125 PetriNetUnfolderBase]: For 7825/7825 co-relation queries the response was YES. [2025-03-17 14:10:57,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11828 conditions, 3606 events. 2280/3606 cut-off events. For 7825/7825 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 17741 event pairs, 1176 based on Foata normal form. 80/3686 useless extension candidates. Maximal degree in co-relation 11805. Up to 2929 conditions per place. [2025-03-17 14:10:57,011 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 51 selfloop transitions, 9 changer transitions 29/94 dead transitions. [2025-03-17 14:10:57,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 94 transitions, 734 flow [2025-03-17 14:10:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:10:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:10:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-03-17 14:10:57,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42329545454545453 [2025-03-17 14:10:57,012 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 263 flow. Second operand 8 states and 149 transitions. [2025-03-17 14:10:57,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 94 transitions, 734 flow [2025-03-17 14:10:57,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 644 flow, removed 27 selfloop flow, removed 6 redundant places. [2025-03-17 14:10:57,025 INFO L231 Difference]: Finished difference. Result has 70 places, 47 transitions, 303 flow [2025-03-17 14:10:57,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=303, PETRI_PLACES=70, PETRI_TRANSITIONS=47} [2025-03-17 14:10:57,025 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2025-03-17 14:10:57,025 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 47 transitions, 303 flow [2025-03-17 14:10:57,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-17 14:10:57,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:57,025 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-17 14:10:57,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:10:57,025 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-17 14:10:57,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:57,026 INFO L85 PathProgramCache]: Analyzing trace with hash -188259454, now seen corresponding path program 1 times [2025-03-17 14:10:57,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:57,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891441295] [2025-03-17 14:10:57,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:57,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:57,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:10:57,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:10:57,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:57,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:57,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:57,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891441295] [2025-03-17 14:10:57,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891441295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:57,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:57,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:10:57,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454823364] [2025-03-17 14:10:57,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:57,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:10:57,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:57,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:10:57,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:10:57,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:57,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 47 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-17 14:10:57,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:57,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:57,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:57,463 INFO L124 PetriNetUnfolderBase]: 1838/2989 cut-off events. [2025-03-17 14:10:57,463 INFO L125 PetriNetUnfolderBase]: For 8440/8445 co-relation queries the response was YES. [2025-03-17 14:10:57,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10436 conditions, 2989 events. 1838/2989 cut-off events. For 8440/8445 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 15189 event pairs, 170 based on Foata normal form. 143/3132 useless extension candidates. Maximal degree in co-relation 10412. Up to 1663 conditions per place. [2025-03-17 14:10:57,472 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 67 selfloop transitions, 5 changer transitions 1/78 dead transitions. [2025-03-17 14:10:57,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 660 flow [2025-03-17 14:10:57,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:10:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:10:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-03-17 14:10:57,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5511363636363636 [2025-03-17 14:10:57,473 INFO L175 Difference]: Start difference. First operand has 70 places, 47 transitions, 303 flow. Second operand 4 states and 97 transitions. [2025-03-17 14:10:57,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 660 flow [2025-03-17 14:10:57,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 633 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-17 14:10:57,479 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 295 flow [2025-03-17 14:10:57,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2025-03-17 14:10:57,480 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2025-03-17 14:10:57,480 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 295 flow [2025-03-17 14:10:57,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-17 14:10:57,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:57,480 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-17 14:10:57,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:10:57,480 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:10:57,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2063301506, now seen corresponding path program 1 times [2025-03-17 14:10:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144126267] [2025-03-17 14:10:57,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:57,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:57,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:10:57,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:10:57,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:57,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:57,582 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-17 14:10:57,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:57,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144126267] [2025-03-17 14:10:57,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144126267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:57,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:57,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:10:57,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103616248] [2025-03-17 14:10:57,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:57,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:10:57,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:57,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:10:57,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:10:57,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:57,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 295 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:57,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:57,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:57,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:57,774 INFO L124 PetriNetUnfolderBase]: 1159/1928 cut-off events. [2025-03-17 14:10:57,774 INFO L125 PetriNetUnfolderBase]: For 5349/5354 co-relation queries the response was YES. [2025-03-17 14:10:57,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6982 conditions, 1928 events. 1159/1928 cut-off events. For 5349/5354 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8817 event pairs, 85 based on Foata normal form. 113/2041 useless extension candidates. Maximal degree in co-relation 6960. Up to 709 conditions per place. [2025-03-17 14:10:57,781 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 69 selfloop transitions, 8 changer transitions 3/85 dead transitions. [2025-03-17 14:10:57,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 701 flow [2025-03-17 14:10:57,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:10:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:10:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-03-17 14:10:57,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5409090909090909 [2025-03-17 14:10:57,783 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 295 flow. Second operand 5 states and 119 transitions. [2025-03-17 14:10:57,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 701 flow [2025-03-17 14:10:57,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 691 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:10:57,787 INFO L231 Difference]: Finished difference. Result has 69 places, 49 transitions, 319 flow [2025-03-17 14:10:57,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2025-03-17 14:10:57,788 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2025-03-17 14:10:57,788 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 319 flow [2025-03-17 14:10:57,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:57,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:57,788 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-17 14:10:57,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:10:57,788 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:10:57,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:57,789 INFO L85 PathProgramCache]: Analyzing trace with hash -387435587, now seen corresponding path program 1 times [2025-03-17 14:10:57,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:57,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222362268] [2025-03-17 14:10:57,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:57,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:57,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:10:57,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:10:57,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:57,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:57,941 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-17 14:10:57,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:57,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222362268] [2025-03-17 14:10:57,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222362268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:57,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:57,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:10:57,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223057422] [2025-03-17 14:10:57,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:57,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:10:57,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:57,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:10:57,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:10:57,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:57,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 319 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-17 14:10:57,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:57,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:57,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:58,096 INFO L124 PetriNetUnfolderBase]: 673/1118 cut-off events. [2025-03-17 14:10:58,096 INFO L125 PetriNetUnfolderBase]: For 3817/3822 co-relation queries the response was YES. [2025-03-17 14:10:58,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4348 conditions, 1118 events. 673/1118 cut-off events. For 3817/3822 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4475 event pairs, 61 based on Foata normal form. 49/1167 useless extension candidates. Maximal degree in co-relation 4324. Up to 384 conditions per place. [2025-03-17 14:10:58,100 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 62 selfloop transitions, 11 changer transitions 3/81 dead transitions. [2025-03-17 14:10:58,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 81 transitions, 665 flow [2025-03-17 14:10:58,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:10:58,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:10:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2025-03-17 14:10:58,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4734848484848485 [2025-03-17 14:10:58,101 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 319 flow. Second operand 6 states and 125 transitions. [2025-03-17 14:10:58,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 81 transitions, 665 flow [2025-03-17 14:10:58,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 81 transitions, 611 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-03-17 14:10:58,105 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 309 flow [2025-03-17 14:10:58,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2025-03-17 14:10:58,105 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2025-03-17 14:10:58,105 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 309 flow [2025-03-17 14:10:58,105 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-17 14:10:58,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:58,105 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] [2025-03-17 14:10:58,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:10:58,105 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:10:58,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1469493767, now seen corresponding path program 1 times [2025-03-17 14:10:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:58,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770822907] [2025-03-17 14:10:58,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:58,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:10:58,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:10:58,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:58,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:58,975 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-17 14:10:58,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:58,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770822907] [2025-03-17 14:10:58,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770822907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:58,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:58,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:10:58,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390537241] [2025-03-17 14:10:58,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:58,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:10:58,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:58,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:10:58,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:10:58,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:58,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 309 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:58,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:58,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:58,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:59,353 INFO L124 PetriNetUnfolderBase]: 850/1400 cut-off events. [2025-03-17 14:10:59,354 INFO L125 PetriNetUnfolderBase]: For 3932/3932 co-relation queries the response was YES. [2025-03-17 14:10:59,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5252 conditions, 1400 events. 850/1400 cut-off events. For 3932/3932 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5827 event pairs, 208 based on Foata normal form. 8/1408 useless extension candidates. Maximal degree in co-relation 5229. Up to 656 conditions per place. [2025-03-17 14:10:59,358 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 47 selfloop transitions, 3 changer transitions 51/106 dead transitions. [2025-03-17 14:10:59,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 106 transitions, 833 flow [2025-03-17 14:10:59,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:10:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:10:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2025-03-17 14:10:59,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39646464646464646 [2025-03-17 14:10:59,360 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 309 flow. Second operand 9 states and 157 transitions. [2025-03-17 14:10:59,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 106 transitions, 833 flow [2025-03-17 14:10:59,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 106 transitions, 628 flow, removed 52 selfloop flow, removed 12 redundant places. [2025-03-17 14:10:59,366 INFO L231 Difference]: Finished difference. Result has 71 places, 43 transitions, 197 flow [2025-03-17 14:10:59,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=197, PETRI_PLACES=71, PETRI_TRANSITIONS=43} [2025-03-17 14:10:59,367 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2025-03-17 14:10:59,367 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 43 transitions, 197 flow [2025-03-17 14:10:59,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:59,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:59,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:59,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:10:59,367 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:10:59,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:59,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1548509909, now seen corresponding path program 2 times [2025-03-17 14:10:59,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:59,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812512720] [2025-03-17 14:10:59,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:10:59,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:59,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:10:59,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:10:59,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:10:59,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:10:59,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:10:59,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:10:59,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:10:59,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:59,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:10:59,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:10:59,457 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:10:59,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-17 14:10:59,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-17 14:10:59,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-17 14:10:59,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-17 14:10:59,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-17 14:10:59,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-17 14:10:59,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-17 14:10:59,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:10:59,460 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:59,526 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:10:59,526 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:10:59,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:10:59 BasicIcfg [2025-03-17 14:10:59,531 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:10:59,532 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:10:59,532 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:10:59,532 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:10:59,533 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:10:44" (3/4) ... [2025-03-17 14:10:59,534 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:10:59,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:10:59,535 INFO L158 Benchmark]: Toolchain (without parser) took 16307.33ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 103.9MB in the beginning and 811.5MB in the end (delta: -707.6MB). Peak memory consumption was 812.6MB. Max. memory is 16.1GB. [2025-03-17 14:10:59,535 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.0MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:10:59,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.63ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 80.7MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:10:59,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.54ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 78.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:10:59,536 INFO L158 Benchmark]: Boogie Preprocessor took 41.15ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 75.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:10:59,536 INFO L158 Benchmark]: IcfgBuilder took 565.08ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 87.4MB in the end (delta: -11.7MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-03-17 14:10:59,537 INFO L158 Benchmark]: TraceAbstraction took 15268.96ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 86.6MB in the beginning and 811.9MB in the end (delta: -725.3MB). Peak memory consumption was 789.6MB. Max. memory is 16.1GB. [2025-03-17 14:10:59,537 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 1.7GB. Free memory was 811.9MB in the beginning and 811.5MB in the end (delta: 351.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:10:59,538 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.20ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.0MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.63ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 80.7MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.54ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 78.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.15ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 75.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 565.08ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 87.4MB in the end (delta: -11.7MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * TraceAbstraction took 15268.96ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 86.6MB in the beginning and 811.9MB in the end (delta: -725.3MB). Peak memory consumption was 789.6MB. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 1.7GB. Free memory was 811.9MB in the beginning and 811.5MB in the end (delta: 351.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-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] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, t1877=-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] [L822] 0 pthread_t t1878; [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L796] 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) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 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 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 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_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 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) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 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 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 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_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0: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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0: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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 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) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 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 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 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_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L17] 0 __assert_fail ("0", "safe004_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 821]: 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: 823]: 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, 68 locations, 66 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1018 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1014 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2873 IncrementalHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 3 mSDtfsCounter, 2873 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=5, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 271 ConstructedInterpolants, 0 QuantifiedInterpolants, 1859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 14:10:59,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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/safe004_power.opt_pso.opt_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 ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:11:01,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:11:01,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-17 14:11:01,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:11:01,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:11:01,693 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:11:01,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:11:01,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:11:01,694 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:11:01,695 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:11:01,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:11:01,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:11:01,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:11:01,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:11:01,696 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:11:01,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:11:01,696 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:11:01,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:11:01,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:11:01,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:11:01,697 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:11:01,697 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:11:01,697 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:11:01,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:11:01,697 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:11:01,697 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 14:11:01,697 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 14:11:01,698 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:11:01,698 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:11:01,698 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:11:01,698 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:11:01,698 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:11:01,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:11:01,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:11:01,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:11:01,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:11:01,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:11:01,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:11:01,700 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 14:11:01,700 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 14:11:01,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:11:01,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:11:01,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:11:01,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:11:01,700 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 -> ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 [2025-03-17 14:11:01,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:11:01,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:11:01,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:11:01,942 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:11:01,942 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:11:01,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2025-03-17 14:11:03,089 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d397a6e86/ae0ba7af71a74a8aa52664bf7e853587/FLAGdc6283dc4 [2025-03-17 14:11:03,352 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:11:03,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2025-03-17 14:11:03,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d397a6e86/ae0ba7af71a74a8aa52664bf7e853587/FLAGdc6283dc4 [2025-03-17 14:11:03,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d397a6e86/ae0ba7af71a74a8aa52664bf7e853587 [2025-03-17 14:11:03,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:11:03,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:11:03,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:11:03,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:11:03,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:11:03,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:11:03" (1/1) ... [2025-03-17 14:11:03,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d619cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:03, skipping insertion in model container [2025-03-17 14:11:03,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:11:03" (1/1) ... [2025-03-17 14:11:03,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:11:03,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:11:03,928 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:11:03,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:11:04,016 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:11:04,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:04 WrapperNode [2025-03-17 14:11:04,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:11:04,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:11:04,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:11:04,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:11:04,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:04" (1/1) ... [2025-03-17 14:11:04,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:04" (1/1) ... [2025-03-17 14:11:04,065 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2025-03-17 14:11:04,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:11:04,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:11:04,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:11:04,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:11:04,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:04" (1/1) ... [2025-03-17 14:11:04,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:04" (1/1) ... [2025-03-17 14:11:04,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:04" (1/1) ... [2025-03-17 14:11:04,092 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-17 14:11:04,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:04" (1/1) ... [2025-03-17 14:11:04,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:04" (1/1) ... [2025-03-17 14:11:04,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:04" (1/1) ... [2025-03-17 14:11:04,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:04" (1/1) ... [2025-03-17 14:11:04,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:04" (1/1) ... [2025-03-17 14:11:04,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:04" (1/1) ... [2025-03-17 14:11:04,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:11:04,112 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:11:04,112 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:11:04,112 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:11:04,113 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:04" (1/1) ... [2025-03-17 14:11:04,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:11:04,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:11:04,141 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-17 14:11:04,143 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-17 14:11:04,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:11:04,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:11:04,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 14:11:04,162 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 14:11:04,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 14:11:04,162 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 14:11:04,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 14:11:04,162 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-17 14:11:04,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-17 14:11:04,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:11:04,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:11:04,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:11:04,163 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:11:04,276 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:11:04,277 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:11:04,534 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:11:04,534 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:11:04,743 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:11:04,743 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:11:04,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:11:04 BoogieIcfgContainer [2025-03-17 14:11:04,744 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:11:04,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:11:04,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:11:04,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:11:04,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:11:03" (1/3) ... [2025-03-17 14:11:04,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d85e4d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:11:04, skipping insertion in model container [2025-03-17 14:11:04,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:04" (2/3) ... [2025-03-17 14:11:04,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d85e4d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:11:04, skipping insertion in model container [2025-03-17 14:11:04,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:11:04" (3/3) ... [2025-03-17 14:11:04,752 INFO L128 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2025-03-17 14:11:04,776 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:11:04,777 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe004_power.opt_pso.opt_rmo.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-17 14:11:04,777 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:11:04,821 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:11:04,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2025-03-17 14:11:04,878 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2025-03-17 14:11:04,881 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:11:04,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-03-17 14:11:04,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2025-03-17 14:11:04,888 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2025-03-17 14:11:04,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:11:04,906 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;@17ff0cfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:11:04,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 14:11:04,912 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:11:04,912 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-17 14:11:04,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:11:04,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:11:04,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:11:04,914 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-17 14:11:04,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:11:04,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1838464095, now seen corresponding path program 1 times [2025-03-17 14:11:04,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:11:04,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571608745] [2025-03-17 14:11:04,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:11:04,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:04,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:11:04,933 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-17 14:11:04,936 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-17 14:11:05,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:11:05,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:11:05,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:11:05,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:11:05,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:11:05,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:11:05,060 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-17 14:11:05,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:11:05,062 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:11:05,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571608745] [2025-03-17 14:11:05,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571608745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:11:05,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:11:05,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:11:05,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408558172] [2025-03-17 14:11:05,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:11:05,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:11:05,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:11:05,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:11:05,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:11:05,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:11:05,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 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-17 14:11:05,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:11:05,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:11:05,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:11:05,943 INFO L124 PetriNetUnfolderBase]: 5315/7699 cut-off events. [2025-03-17 14:11:05,944 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-17 14:11:05,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15350 conditions, 7699 events. 5315/7699 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 42906 event pairs, 585 based on Foata normal form. 432/8119 useless extension candidates. Maximal degree in co-relation 15339. Up to 6591 conditions per place. [2025-03-17 14:11:05,977 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 47 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2025-03-17 14:11:05,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 230 flow [2025-03-17 14:11:05,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:11:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:11:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-17 14:11:05,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-03-17 14:11:05,987 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 86 transitions. [2025-03-17 14:11:05,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 230 flow [2025-03-17 14:11:05,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:11:05,992 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2025-03-17 14:11:05,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-03-17 14:11:05,996 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2025-03-17 14:11:05,996 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2025-03-17 14:11:05,996 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-17 14:11:05,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:11:05,997 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:11:06,005 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-17 14:11:06,201 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-17 14:11:06,201 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-17 14:11:06,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:11:06,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1258405481, now seen corresponding path program 1 times [2025-03-17 14:11:06,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:11:06,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2132033332] [2025-03-17 14:11:06,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:11:06,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:06,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:11:06,205 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-17 14:11:06,206 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-17 14:11:06,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:11:06,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:11:06,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:11:06,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:11:06,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:11:06,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:11:06,306 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-17 14:11:06,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:11:06,307 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:11:06,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132033332] [2025-03-17 14:11:06,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132033332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:11:06,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:11:06,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:11:06,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447449589] [2025-03-17 14:11:06,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:11:06,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:11:06,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:11:06,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:11:06,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:11:06,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:11:06,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 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-17 14:11:06,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:11:06,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:11:06,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:11:06,887 INFO L124 PetriNetUnfolderBase]: 4775/7427 cut-off events. [2025-03-17 14:11:06,887 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2025-03-17 14:11:06,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14657 conditions, 7427 events. 4775/7427 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 43908 event pairs, 4775 based on Foata normal form. 216/7592 useless extension candidates. Maximal degree in co-relation 14647. Up to 6804 conditions per place. [2025-03-17 14:11:06,922 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-03-17 14:11:06,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 138 flow [2025-03-17 14:11:06,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:11:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:11:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-03-17 14:11:06,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-03-17 14:11:06,924 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 57 transitions. [2025-03-17 14:11:06,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 138 flow [2025-03-17 14:11:06,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:11:06,927 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2025-03-17 14:11:06,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-03-17 14:11:06,929 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2025-03-17 14:11:06,929 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2025-03-17 14:11:06,929 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-17 14:11:06,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:11:06,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:11:06,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:11:07,129 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-17 14:11:07,130 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-17 14:11:07,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:11:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1258405169, now seen corresponding path program 1 times [2025-03-17 14:11:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:11:07,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507857235] [2025-03-17 14:11:07,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:11:07,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:07,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:11:07,133 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-17 14:11:07,134 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-17 14:11:07,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:11:07,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:11:07,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:11:07,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:11:07,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:11:07,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:11:07,232 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-17 14:11:07,233 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:11:07,233 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:11:07,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507857235] [2025-03-17 14:11:07,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507857235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:11:07,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:11:07,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:11:07,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510390163] [2025-03-17 14:11:07,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:11:07,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:11:07,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:11:07,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:11:07,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:11:07,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:11:07,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 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-17 14:11:07,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:11:07,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:11:07,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:11:07,699 INFO L124 PetriNetUnfolderBase]: 3471/5583 cut-off events. [2025-03-17 14:11:07,699 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:11:07,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10789 conditions, 5583 events. 3471/5583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 33238 event pairs, 535 based on Foata normal form. 216/5786 useless extension candidates. Maximal degree in co-relation 10783. Up to 3001 conditions per place. [2025-03-17 14:11:07,727 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 55 selfloop transitions, 5 changer transitions 1/67 dead transitions. [2025-03-17 14:11:07,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 268 flow [2025-03-17 14:11:07,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:11:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:11:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-03-17 14:11:07,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5852272727272727 [2025-03-17 14:11:07,730 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 103 transitions. [2025-03-17 14:11:07,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 268 flow [2025-03-17 14:11:07,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:11:07,731 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow [2025-03-17 14:11:07,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-03-17 14:11:07,732 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2025-03-17 14:11:07,732 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow [2025-03-17 14:11:07,732 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-17 14:11:07,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:11:07,732 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-17 14:11:07,741 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-17 14:11:07,933 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-17 14:11:07,934 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-17 14:11:07,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:11:07,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1751317738, now seen corresponding path program 1 times [2025-03-17 14:11:07,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:11:07,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286491014] [2025-03-17 14:11:07,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:11:07,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:07,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:11:07,959 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-17 14:11:07,961 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-17 14:11:08,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:11:08,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:11:08,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:11:08,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:11:08,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:11:08,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:11:08,088 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-17 14:11:08,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:11:08,090 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:11:08,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286491014] [2025-03-17 14:11:08,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286491014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:11:08,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:11:08,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:11:08,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507459480] [2025-03-17 14:11:08,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:11:08,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:11:08,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:11:08,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:11:08,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:11:08,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:11:08,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 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-17 14:11:08,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:11:08,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:11:08,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:11:08,367 INFO L124 PetriNetUnfolderBase]: 1935/3119 cut-off events. [2025-03-17 14:11:08,367 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2025-03-17 14:11:08,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7056 conditions, 3119 events. 1935/3119 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 15968 event pairs, 339 based on Foata normal form. 152/3258 useless extension candidates. Maximal degree in co-relation 7047. Up to 985 conditions per place. [2025-03-17 14:11:08,379 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 70 selfloop transitions, 8 changer transitions 1/85 dead transitions. [2025-03-17 14:11:08,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 384 flow [2025-03-17 14:11:08,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:11:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:11:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-17 14:11:08,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5954545454545455 [2025-03-17 14:11:08,381 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 131 transitions. [2025-03-17 14:11:08,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 85 transitions, 384 flow [2025-03-17 14:11:08,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 374 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:11:08,384 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow [2025-03-17 14:11:08,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-03-17 14:11:08,384 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2025-03-17 14:11:08,385 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow [2025-03-17 14:11:08,385 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-17 14:11:08,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:11:08,385 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-17 14:11:08,392 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-17 14:11:08,589 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-17 14:11:08,589 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-17 14:11:08,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:11:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash 302377765, now seen corresponding path program 1 times [2025-03-17 14:11:08,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:11:08,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1343322270] [2025-03-17 14:11:08,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:11:08,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:08,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:11:08,592 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-17 14:11:08,594 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-17 14:11:08,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:11:08,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:11:08,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:11:08,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:11:08,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:11:08,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:11:08,705 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-17 14:11:08,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:11:08,708 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:11:08,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343322270] [2025-03-17 14:11:08,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343322270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:11:08,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:11:08,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:11:08,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456366014] [2025-03-17 14:11:08,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:11:08,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:11:08,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:11:08,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:11:08,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:11:08,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:11:08,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 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-17 14:11:08,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:11:08,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:11:08,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:11:08,955 INFO L124 PetriNetUnfolderBase]: 1167/1823 cut-off events. [2025-03-17 14:11:08,955 INFO L125 PetriNetUnfolderBase]: For 1138/1138 co-relation queries the response was YES. [2025-03-17 14:11:08,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4568 conditions, 1823 events. 1167/1823 cut-off events. For 1138/1138 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8113 event pairs, 303 based on Foata normal form. 56/1866 useless extension candidates. Maximal degree in co-relation 4557. Up to 672 conditions per place. [2025-03-17 14:11:08,961 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 59 selfloop transitions, 11 changer transitions 1/77 dead transitions. [2025-03-17 14:11:08,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 375 flow [2025-03-17 14:11:08,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:11:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:11:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-03-17 14:11:08,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037878787878788 [2025-03-17 14:11:08,966 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 133 transitions. [2025-03-17 14:11:08,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 375 flow [2025-03-17 14:11:08,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 350 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-17 14:11:08,975 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow [2025-03-17 14:11:08,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-03-17 14:11:08,977 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2025-03-17 14:11:08,978 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow [2025-03-17 14:11:08,978 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-17 14:11:08,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:11:08,978 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] [2025-03-17 14:11:08,986 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-17 14:11:09,178 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-17 14:11:09,179 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-17 14:11:09,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:11:09,179 INFO L85 PathProgramCache]: Analyzing trace with hash -305707513, now seen corresponding path program 1 times [2025-03-17 14:11:09,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:11:09,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794605359] [2025-03-17 14:11:09,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:11:09,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:09,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:11:09,182 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-17 14:11:09,183 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-17 14:11:09,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:11:09,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:11:09,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:11:09,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:11:09,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:11:09,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:11:09,419 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-17 14:11:09,420 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:11:09,420 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:11:09,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794605359] [2025-03-17 14:11:09,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794605359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:11:09,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:11:09,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:11:09,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183843825] [2025-03-17 14:11:09,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:11:09,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:11:09,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:11:09,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:11:09,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:11:09,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:11:09,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 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-17 14:11:09,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:11:09,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:11:09,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:11:09,903 INFO L124 PetriNetUnfolderBase]: 1941/2981 cut-off events. [2025-03-17 14:11:09,903 INFO L125 PetriNetUnfolderBase]: For 2356/2356 co-relation queries the response was YES. [2025-03-17 14:11:09,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7723 conditions, 2981 events. 1941/2981 cut-off events. For 2356/2356 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14339 event pairs, 307 based on Foata normal form. 8/2983 useless extension candidates. Maximal degree in co-relation 7711. Up to 1247 conditions per place. [2025-03-17 14:11:09,911 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 54 selfloop transitions, 9 changer transitions 52/121 dead transitions. [2025-03-17 14:11:09,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 121 transitions, 671 flow [2025-03-17 14:11:09,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:11:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:11:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 210 transitions. [2025-03-17 14:11:09,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-03-17 14:11:09,914 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 10 states and 210 transitions. [2025-03-17 14:11:09,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 121 transitions, 671 flow [2025-03-17 14:11:09,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 121 transitions, 538 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-17 14:11:09,924 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 168 flow [2025-03-17 14:11:09,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=168, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2025-03-17 14:11:09,925 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2025-03-17 14:11:09,926 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 168 flow [2025-03-17 14:11:09,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 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-17 14:11:09,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:11:09,926 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] [2025-03-17 14:11:09,932 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-17 14:11:10,129 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-17 14:11:10,129 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-17 14:11:10,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:11:10,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1054585619, now seen corresponding path program 2 times [2025-03-17 14:11:10,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:11:10,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1627820096] [2025-03-17 14:11:10,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:11:10,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:10,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:11:10,132 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-17 14:11:10,132 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-17 14:11:10,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:11:10,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:11:10,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:11:10,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:11:10,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:11:10,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:11:10,380 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-17 14:11:10,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:11:10,380 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:11:10,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627820096] [2025-03-17 14:11:10,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627820096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:11:10,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:11:10,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:11:10,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886853070] [2025-03-17 14:11:10,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:11:10,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:11:10,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:11:10,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:11:10,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:11:10,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:11:10,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 168 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:11:10,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:11:10,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:11:10,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:11:10,706 INFO L124 PetriNetUnfolderBase]: 1861/2878 cut-off events. [2025-03-17 14:11:10,706 INFO L125 PetriNetUnfolderBase]: For 1075/1078 co-relation queries the response was YES. [2025-03-17 14:11:10,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7377 conditions, 2878 events. 1861/2878 cut-off events. For 1075/1078 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 13801 event pairs, 301 based on Foata normal form. 8/2884 useless extension candidates. Maximal degree in co-relation 7362. Up to 1146 conditions per place. [2025-03-17 14:11:10,715 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 64 selfloop transitions, 9 changer transitions 26/105 dead transitions. [2025-03-17 14:11:10,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 105 transitions, 570 flow [2025-03-17 14:11:10,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:11:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:11:10,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2025-03-17 14:11:10,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-17 14:11:10,717 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 168 flow. Second operand 7 states and 154 transitions. [2025-03-17 14:11:10,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 105 transitions, 570 flow [2025-03-17 14:11:10,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 105 transitions, 522 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-03-17 14:11:10,722 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 235 flow [2025-03-17 14:11:10,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2025-03-17 14:11:10,723 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2025-03-17 14:11:10,723 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 235 flow [2025-03-17 14:11:10,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:11:10,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:11:10,723 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] [2025-03-17 14:11:10,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:11:10,927 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-17 14:11:10,928 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-17 14:11:10,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:11:10,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1395197729, now seen corresponding path program 3 times [2025-03-17 14:11:10,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:11:10,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521920202] [2025-03-17 14:11:10,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:11:10,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:10,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:11:10,933 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-17 14:11:10,935 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-17 14:11:10,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:11:11,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:11:11,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:11:11,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:11:11,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:11:11,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:11:11,210 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-17 14:11:11,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:11:11,210 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:11:11,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521920202] [2025-03-17 14:11:11,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521920202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:11:11,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:11:11,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:11:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981142998] [2025-03-17 14:11:11,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:11:11,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:11:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:11:11,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:11:11,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:11:11,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:11:11,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 235 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-17 14:11:11,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:11:11,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:11:11,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:11:11,576 INFO L124 PetriNetUnfolderBase]: 1429/2277 cut-off events. [2025-03-17 14:11:11,577 INFO L125 PetriNetUnfolderBase]: For 1083/1098 co-relation queries the response was YES. [2025-03-17 14:11:11,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5908 conditions, 2277 events. 1429/2277 cut-off events. For 1083/1098 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10576 event pairs, 335 based on Foata normal form. 15/2291 useless extension candidates. Maximal degree in co-relation 5893. Up to 953 conditions per place. [2025-03-17 14:11:11,587 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 54 selfloop transitions, 12 changer transitions 31/103 dead transitions. [2025-03-17 14:11:11,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 103 transitions, 561 flow [2025-03-17 14:11:11,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:11:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:11:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2025-03-17 14:11:11,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744318181818182 [2025-03-17 14:11:11,588 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 235 flow. Second operand 8 states and 167 transitions. [2025-03-17 14:11:11,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 103 transitions, 561 flow [2025-03-17 14:11:11,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 539 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-17 14:11:11,591 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 218 flow [2025-03-17 14:11:11,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2025-03-17 14:11:11,594 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2025-03-17 14:11:11,594 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 218 flow [2025-03-17 14:11:11,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-17 14:11:11,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:11:11,595 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] [2025-03-17 14:11:11,602 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-17 14:11:11,795 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-17 14:11:11,795 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-17 14:11:11,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:11:11,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2031043533, now seen corresponding path program 4 times [2025-03-17 14:11:11,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:11:11,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985589257] [2025-03-17 14:11:11,796 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:11:11,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:11,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:11:11,798 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-17 14:11:11,799 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-17 14:11:11,846 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-17 14:11:11,859 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 30 statements. [2025-03-17 14:11:11,859 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 14:11:11,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:11:11,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 14:11:11,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:11:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:11:12,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:11:12,094 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:11:12,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985589257] [2025-03-17 14:11:12,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985589257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:11:12,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:11:12,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:11:12,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922995722] [2025-03-17 14:11:12,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:11:12,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:11:12,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:11:12,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:11:12,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:11:12,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:11:12,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-17 14:11:12,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:11:12,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:11:12,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:11:12,353 INFO L124 PetriNetUnfolderBase]: 1043/1674 cut-off events. [2025-03-17 14:11:12,354 INFO L125 PetriNetUnfolderBase]: For 988/990 co-relation queries the response was YES. [2025-03-17 14:11:12,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 1674 events. 1043/1674 cut-off events. For 988/990 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7130 event pairs, 255 based on Foata normal form. 8/1682 useless extension candidates. Maximal degree in co-relation 4314. Up to 918 conditions per place. [2025-03-17 14:11:12,359 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 44 selfloop transitions, 2 changer transitions 37/89 dead transitions. [2025-03-17 14:11:12,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 89 transitions, 517 flow [2025-03-17 14:11:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:11:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:11:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-03-17 14:11:12,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4383116883116883 [2025-03-17 14:11:12,361 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 218 flow. Second operand 7 states and 135 transitions. [2025-03-17 14:11:12,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 89 transitions, 517 flow [2025-03-17 14:11:12,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 454 flow, removed 12 selfloop flow, removed 10 redundant places. [2025-03-17 14:11:12,364 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 169 flow [2025-03-17 14:11:12,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=169, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-03-17 14:11:12,364 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2025-03-17 14:11:12,364 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 169 flow [2025-03-17 14:11:12,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-17 14:11:12,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:11:12,365 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] [2025-03-17 14:11:12,371 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-17 14:11:12,565 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-17 14:11:12,565 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-17 14:11:12,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:11:12,568 INFO L85 PathProgramCache]: Analyzing trace with hash -958102401, now seen corresponding path program 5 times [2025-03-17 14:11:12,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:11:12,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1707964846] [2025-03-17 14:11:12,569 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:11:12,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:12,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:11:12,571 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:11:12,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:11:12,620 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:11:12,639 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:11:12,639 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:11:12,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:11:12,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:11:12,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:11:12,829 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-17 14:11:12,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:11:12,829 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:11:12,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707964846] [2025-03-17 14:11:12,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707964846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:11:12,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:11:12,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:11:12,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676753700] [2025-03-17 14:11:12,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:11:12,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:11:12,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:11:12,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:11:12,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:11:12,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:11:12,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 169 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 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-17 14:11:12,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:11:12,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:11:12,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:11:13,059 INFO L124 PetriNetUnfolderBase]: 897/1504 cut-off events. [2025-03-17 14:11:13,059 INFO L125 PetriNetUnfolderBase]: For 641/643 co-relation queries the response was YES. [2025-03-17 14:11:13,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3631 conditions, 1504 events. 897/1504 cut-off events. For 641/643 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6708 event pairs, 315 based on Foata normal form. 8/1512 useless extension candidates. Maximal degree in co-relation 3618. Up to 868 conditions per place. [2025-03-17 14:11:13,063 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 48 selfloop transitions, 4 changer transitions 20/78 dead transitions. [2025-03-17 14:11:13,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 416 flow [2025-03-17 14:11:13,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:11:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:11:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2025-03-17 14:11:13,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-17 14:11:13,067 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 169 flow. Second operand 7 states and 126 transitions. [2025-03-17 14:11:13,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 416 flow [2025-03-17 14:11:13,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 400 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-17 14:11:13,070 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 186 flow [2025-03-17 14:11:13,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2025-03-17 14:11:13,071 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2025-03-17 14:11:13,071 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 186 flow [2025-03-17 14:11:13,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 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-17 14:11:13,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:11:13,071 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] [2025-03-17 14:11:13,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 14:11:13,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:13,272 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-17 14:11:13,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:11:13,274 INFO L85 PathProgramCache]: Analyzing trace with hash 393394351, now seen corresponding path program 6 times [2025-03-17 14:11:13,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:11:13,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251325446] [2025-03-17 14:11:13,274 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:11:13,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:13,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:11:13,276 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:11:13,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:11:13,326 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:11:13,344 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:11:13,344 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 14:11:13,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:11:13,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 14:11:13,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:11:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:11:13,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:11:13,630 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:11:13,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251325446] [2025-03-17 14:11:13,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251325446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:11:13,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:11:13,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:11:13,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66501632] [2025-03-17 14:11:13,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:11:13,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:11:13,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:11:13,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:11:13,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:11:13,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:11:13,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 186 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:11:13,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:11:13,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:11:13,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:11:13,875 INFO L124 PetriNetUnfolderBase]: 1011/1690 cut-off events. [2025-03-17 14:11:13,875 INFO L125 PetriNetUnfolderBase]: For 761/763 co-relation queries the response was YES. [2025-03-17 14:11:13,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4398 conditions, 1690 events. 1011/1690 cut-off events. For 761/763 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7740 event pairs, 363 based on Foata normal form. 8/1698 useless extension candidates. Maximal degree in co-relation 4384. Up to 790 conditions per place. [2025-03-17 14:11:13,880 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 42 selfloop transitions, 4 changer transitions 27/79 dead transitions. [2025-03-17 14:11:13,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 79 transitions, 435 flow [2025-03-17 14:11:13,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:11:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:11:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2025-03-17 14:11:13,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-17 14:11:13,881 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 186 flow. Second operand 7 states and 126 transitions. [2025-03-17 14:11:13,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 79 transitions, 435 flow [2025-03-17 14:11:13,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 420 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-17 14:11:13,883 INFO L231 Difference]: Finished difference. Result has 66 places, 44 transitions, 176 flow [2025-03-17 14:11:13,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=66, PETRI_TRANSITIONS=44} [2025-03-17 14:11:13,883 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2025-03-17 14:11:13,884 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 44 transitions, 176 flow [2025-03-17 14:11:13,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:11:13,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:11:13,884 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] [2025-03-17 14:11:13,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 14:11:14,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:14,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:11:14,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:11:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash 843506325, now seen corresponding path program 7 times [2025-03-17 14:11:14,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:11:14,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [249130223] [2025-03-17 14:11:14,085 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:11:14,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:14,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:11:14,087 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:11:14,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:11:14,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:11:14,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:11:14,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:11:14,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:11:14,150 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:11:14,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:11:14,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:11:14,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:11:14,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:11:14,202 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-17 14:11:14,203 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:11:14,203 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-17 14:11:14,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-17 14:11:14,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-17 14:11:14,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-17 14:11:14,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-17 14:11:14,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-17 14:11:14,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-17 14:11:14,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 14:11:14,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:11:14,406 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2025-03-17 14:11:14,474 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:11:14,474 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:11:14,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:11:14 BasicIcfg [2025-03-17 14:11:14,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:11:14,480 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:11:14,480 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:11:14,480 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:11:14,480 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:11:04" (3/4) ... [2025-03-17 14:11:14,482 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:11:14,483 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:11:14,483 INFO L158 Benchmark]: Toolchain (without parser) took 10825.22ms. Allocated memory was 117.4MB in the beginning and 654.3MB in the end (delta: 536.9MB). Free memory was 91.4MB in the beginning and 369.1MB in the end (delta: -277.8MB). Peak memory consumption was 259.5MB. Max. memory is 16.1GB. [2025-03-17 14:11:14,483 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 83.9MB. Free memory was 61.1MB in the beginning and 61.0MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:11:14,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.66ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 68.0MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:11:14,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.31ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:11:14,484 INFO L158 Benchmark]: Boogie Preprocessor took 43.50ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 62.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:11:14,484 INFO L158 Benchmark]: IcfgBuilder took 632.61ms. Allocated memory is still 117.4MB. Free memory was 62.6MB in the beginning and 41.9MB in the end (delta: 20.7MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2025-03-17 14:11:14,484 INFO L158 Benchmark]: TraceAbstraction took 9733.19ms. Allocated memory was 117.4MB in the beginning and 654.3MB in the end (delta: 536.9MB). Free memory was 41.9MB in the beginning and 369.2MB in the end (delta: -327.3MB). Peak memory consumption was 212.8MB. Max. memory is 16.1GB. [2025-03-17 14:11:14,484 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 654.3MB. Free memory was 369.2MB in the beginning and 369.1MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:11:14,485 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 83.9MB. Free memory was 61.1MB in the beginning and 61.0MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.66ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 68.0MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.31ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.50ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 62.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 632.61ms. Allocated memory is still 117.4MB. Free memory was 62.6MB in the beginning and 41.9MB in the end (delta: 20.7MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9733.19ms. Allocated memory was 117.4MB in the beginning and 654.3MB in the end (delta: 536.9MB). Free memory was 41.9MB in the beginning and 369.2MB in the end (delta: -327.3MB). Peak memory consumption was 212.8MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 654.3MB. Free memory was 369.2MB in the beginning and 369.1MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-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] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, t1877=-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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1878; [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L796] 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) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 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 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 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_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 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) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 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 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 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=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0: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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0: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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 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) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 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 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 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_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L17] 0 __assert_fail ("0", "safe004_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 821]: 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: 823]: 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, 68 locations, 66 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 622 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 609 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2079 IncrementalHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 4 mSDtfsCounter, 2079 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=7, InterpolantAutomatonStates: 67, 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.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 291 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 1382 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1200 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-17 14:11:14,497 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