./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix043.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix043.oepc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:43:51,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:43:51,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:43:51,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:43:51,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:43:51,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:43:51,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:43:51,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:43:51,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:43:51,546 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:43:51,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:43:51,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:43:51,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:43:51,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:43:51,547 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:43:51,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:43:51,547 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:43:51,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:43:51,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:43:51,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:43:51,548 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:43:51,548 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:43:51,548 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:43:51,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:43:51,548 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:43:51,548 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:43:51,548 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:43:51,549 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:43:51,549 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:43:51,549 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:43:51,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:43:51,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:43:51,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:43:51,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:43:51,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:43:51,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:43:51,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:43:51,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:43:51,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:43:51,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:43:51,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:43:51,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:43:51,550 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 [2025-02-06 12:43:51,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:43:51,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:43:51,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:43:51,826 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:43:51,826 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:43:51,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix043.oepc.i [2025-02-06 12:43:53,115 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff622ed7b/ae78611a455b4041809fb1f11ce109de/FLAG3dd4c4001 [2025-02-06 12:43:53,418 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:43:53,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix043.oepc.i [2025-02-06 12:43:53,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff622ed7b/ae78611a455b4041809fb1f11ce109de/FLAG3dd4c4001 [2025-02-06 12:43:53,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff622ed7b/ae78611a455b4041809fb1f11ce109de [2025-02-06 12:43:53,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:43:53,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:43:53,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:43:53,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:43:53,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:43:53,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:43:53" (1/1) ... [2025-02-06 12:43:53,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f260abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53, skipping insertion in model container [2025-02-06 12:43:53,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:43:53" (1/1) ... [2025-02-06 12:43:53,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:43:53,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:43:53,753 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:43:53,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:43:53,860 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:43:53,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53 WrapperNode [2025-02-06 12:43:53,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:43:53,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:43:53,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:43:53,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:43:53,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53" (1/1) ... [2025-02-06 12:43:53,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53" (1/1) ... [2025-02-06 12:43:53,894 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2025-02-06 12:43:53,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:43:53,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:43:53,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:43:53,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:43:53,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53" (1/1) ... [2025-02-06 12:43:53,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53" (1/1) ... [2025-02-06 12:43:53,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53" (1/1) ... [2025-02-06 12:43:53,918 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-02-06 12:43:53,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53" (1/1) ... [2025-02-06 12:43:53,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53" (1/1) ... [2025-02-06 12:43:53,926 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53" (1/1) ... [2025-02-06 12:43:53,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53" (1/1) ... [2025-02-06 12:43:53,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53" (1/1) ... [2025-02-06 12:43:53,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53" (1/1) ... [2025-02-06 12:43:53,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:43:53,932 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:43:53,932 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:43:53,932 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:43:53,933 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53" (1/1) ... [2025-02-06 12:43:53,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:43:53,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:43:53,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:43:53,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:43:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:43:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:43:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:43:53,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:43:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:43:53,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:43:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:43:53,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:43:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-02-06 12:43:53,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-02-06 12:43:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:43:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:43:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:43:54,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:43:54,001 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:43:54,110 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:43:54,111 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:43:54,437 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:43:54,437 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:43:54,645 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:43:54,646 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:43:54,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:43:54 BoogieIcfgContainer [2025-02-06 12:43:54,647 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:43:54,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:43:54,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:43:54,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:43:54,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:43:53" (1/3) ... [2025-02-06 12:43:54,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72829888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:43:54, skipping insertion in model container [2025-02-06 12:43:54,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:53" (2/3) ... [2025-02-06 12:43:54,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72829888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:43:54, skipping insertion in model container [2025-02-06 12:43:54,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:43:54" (3/3) ... [2025-02-06 12:43:54,658 INFO L128 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2025-02-06 12:43:54,673 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:43:54,674 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix043.oepc.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:43:54,674 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:43:54,720 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:43:54,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2025-02-06 12:43:54,765 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-02-06 12:43:54,767 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:43:54,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-02-06 12:43:54,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2025-02-06 12:43:54,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2025-02-06 12:43:54,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:43:54,806 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;@1ecb4faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:43:54,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 12:43:54,810 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:43:54,811 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-02-06 12:43:54,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:43:54,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:43:54,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:43:54,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:43:54,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:43:54,816 INFO L85 PathProgramCache]: Analyzing trace with hash 14016620, now seen corresponding path program 1 times [2025-02-06 12:43:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:43:54,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814693300] [2025-02-06 12:43:54,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:43:54,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:43:54,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:43:54,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:43:54,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:43:54,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:43:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:43:55,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:43:55,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814693300] [2025-02-06 12:43:55,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814693300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:43:55,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:43:55,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:43:55,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219610146] [2025-02-06 12:43:55,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:43:55,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:43:55,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:43:55,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:43:55,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:43:55,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:43:55,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:43:55,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:43:55,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:43:55,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:00,686 INFO L124 PetriNetUnfolderBase]: 57803/76548 cut-off events. [2025-02-06 12:44:00,687 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2025-02-06 12:44:00,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152672 conditions, 76548 events. 57803/76548 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 2146. Compared 472112 event pairs, 7163 based on Foata normal form. 3420/79926 useless extension candidates. Maximal degree in co-relation 152660. Up to 65471 conditions per place. [2025-02-06 12:44:01,541 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 67 selfloop transitions, 2 changer transitions 2/79 dead transitions. [2025-02-06 12:44:01,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 321 flow [2025-02-06 12:44:01,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:44:01,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:44:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-02-06 12:44:01,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2025-02-06 12:44:01,551 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 112 transitions. [2025-02-06 12:44:01,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 321 flow [2025-02-06 12:44:01,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 79 transitions, 314 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:44:01,557 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2025-02-06 12:44:01,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, 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=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-02-06 12:44:01,561 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2025-02-06 12:44:01,561 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2025-02-06 12:44:01,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:01,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:01,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:44:01,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:44:01,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:01,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:01,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1717314884, now seen corresponding path program 1 times [2025-02-06 12:44:01,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:44:01,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276412777] [2025-02-06 12:44:01,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:44:01,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:44:01,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:44:01,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:44:01,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:44:01,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:01,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:44:01,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276412777] [2025-02-06 12:44:01,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276412777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:01,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:01,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:44:01,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46963329] [2025-02-06 12:44:01,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:01,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:44:01,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:44:01,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:44:01,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:44:01,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-02-06 12:44:01,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:01,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:01,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-02-06 12:44:01,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:07,051 INFO L124 PetriNetUnfolderBase]: 51971/72409 cut-off events. [2025-02-06 12:44:07,051 INFO L125 PetriNetUnfolderBase]: For 2678/2678 co-relation queries the response was YES. [2025-02-06 12:44:07,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143649 conditions, 72409 events. 51971/72409 cut-off events. For 2678/2678 co-relation queries the response was YES. Maximal size of possible extension queue 2166. Compared 473657 event pairs, 51971 based on Foata normal form. 1728/73891 useless extension candidates. Maximal degree in co-relation 143639. Up to 68040 conditions per place. [2025-02-06 12:44:07,478 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 36 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-02-06 12:44:07,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 178 flow [2025-02-06 12:44:07,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:44:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:44:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-02-06 12:44:07,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-02-06 12:44:07,480 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 72 transitions. [2025-02-06 12:44:07,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 178 flow [2025-02-06 12:44:07,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:44:07,484 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2025-02-06 12:44:07,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-02-06 12:44:07,485 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-02-06 12:44:07,485 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2025-02-06 12:44:07,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:07,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:07,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:44:07,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:44:07,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:07,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:07,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1717314334, now seen corresponding path program 1 times [2025-02-06 12:44:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:44:07,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357307178] [2025-02-06 12:44:07,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:44:07,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:44:07,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:44:07,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:44:07,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:44:07,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:07,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:44:07,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357307178] [2025-02-06 12:44:07,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357307178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:07,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:07,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:44:07,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370146915] [2025-02-06 12:44:07,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:07,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:44:07,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:44:07,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:44:07,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:44:07,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:44:07,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:07,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:07,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:44:07,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:11,448 INFO L124 PetriNetUnfolderBase]: 41411/59249 cut-off events. [2025-02-06 12:44:11,449 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:44:11,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114947 conditions, 59249 events. 41411/59249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1839. Compared 405033 event pairs, 5075 based on Foata normal form. 1728/60963 useless extension candidates. Maximal degree in co-relation 114941. Up to 33841 conditions per place. [2025-02-06 12:44:11,686 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 78 selfloop transitions, 6 changer transitions 1/92 dead transitions. [2025-02-06 12:44:11,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 370 flow [2025-02-06 12:44:11,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:44:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:44:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-02-06 12:44:11,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-02-06 12:44:11,690 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 4 states and 135 transitions. [2025-02-06 12:44:11,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 370 flow [2025-02-06 12:44:11,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:44:11,692 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 139 flow [2025-02-06 12:44:11,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-02-06 12:44:11,693 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2025-02-06 12:44:11,693 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 139 flow [2025-02-06 12:44:11,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:11,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:11,694 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-02-06 12:44:11,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:44:11,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:11,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:11,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2145028404, now seen corresponding path program 1 times [2025-02-06 12:44:11,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:44:11,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692523964] [2025-02-06 12:44:11,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:44:11,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:44:11,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:44:11,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:44:11,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:44:11,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:11,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:44:11,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692523964] [2025-02-06 12:44:11,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692523964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:11,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:11,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:44:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961404559] [2025-02-06 12:44:11,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:11,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:44:11,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:44:11,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:44:11,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:44:11,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:44:11,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:11,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:11,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:44:11,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:14,223 INFO L124 PetriNetUnfolderBase]: 25795/36913 cut-off events. [2025-02-06 12:44:14,223 INFO L125 PetriNetUnfolderBase]: For 7038/7038 co-relation queries the response was YES. [2025-02-06 12:44:14,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81794 conditions, 36913 events. 25795/36913 cut-off events. For 7038/7038 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 232618 event pairs, 2975 based on Foata normal form. 1344/38243 useless extension candidates. Maximal degree in co-relation 81785. Up to 14833 conditions per place. [2025-02-06 12:44:14,404 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 101 selfloop transitions, 10 changer transitions 1/119 dead transitions. [2025-02-06 12:44:14,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 119 transitions, 534 flow [2025-02-06 12:44:14,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:44:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:44:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2025-02-06 12:44:14,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6327272727272727 [2025-02-06 12:44:14,406 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 139 flow. Second operand 5 states and 174 transitions. [2025-02-06 12:44:14,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 119 transitions, 534 flow [2025-02-06 12:44:14,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 119 transitions, 523 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:44:14,416 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 191 flow [2025-02-06 12:44:14,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2025-02-06 12:44:14,417 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2025-02-06 12:44:14,417 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 191 flow [2025-02-06 12:44:14,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:14,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:14,418 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-02-06 12:44:14,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:44:14,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:14,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1894206159, now seen corresponding path program 1 times [2025-02-06 12:44:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:44:14,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532899083] [2025-02-06 12:44:14,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:44:14,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:44:14,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 12:44:14,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 12:44:14,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:44:14,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:14,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:44:14,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532899083] [2025-02-06 12:44:14,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532899083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:14,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:14,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:44:14,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131803261] [2025-02-06 12:44:14,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:14,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:44:14,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:44:14,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:44:14,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:44:14,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:44:14,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-02-06 12:44:14,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:14,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:44:14,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:16,562 INFO L124 PetriNetUnfolderBase]: 15171/21265 cut-off events. [2025-02-06 12:44:16,563 INFO L125 PetriNetUnfolderBase]: For 12934/12934 co-relation queries the response was YES. [2025-02-06 12:44:16,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51862 conditions, 21265 events. 15171/21265 cut-off events. For 12934/12934 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 117382 event pairs, 2591 based on Foata normal form. 640/21891 useless extension candidates. Maximal degree in co-relation 51851. Up to 6144 conditions per place. [2025-02-06 12:44:16,641 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 122 selfloop transitions, 14 changer transitions 1/144 dead transitions. [2025-02-06 12:44:16,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 697 flow [2025-02-06 12:44:16,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:44:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:44:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2025-02-06 12:44:16,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6393939393939394 [2025-02-06 12:44:16,643 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 191 flow. Second operand 6 states and 211 transitions. [2025-02-06 12:44:16,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 697 flow [2025-02-06 12:44:16,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 144 transitions, 667 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 12:44:16,781 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 241 flow [2025-02-06 12:44:16,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-02-06 12:44:16,781 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-02-06 12:44:16,782 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 241 flow [2025-02-06 12:44:16,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-02-06 12:44:16,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:16,782 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:44:16,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:44:16,782 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:16,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:16,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1285825748, now seen corresponding path program 1 times [2025-02-06 12:44:16,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:44:16,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629948260] [2025-02-06 12:44:16,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:44:16,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:44:16,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 12:44:16,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 12:44:16,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:44:16,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:17,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:44:17,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629948260] [2025-02-06 12:44:17,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629948260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:17,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:17,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:44:17,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370133570] [2025-02-06 12:44:17,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:17,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:44:17,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:44:17,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:44:17,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:44:17,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:44:17,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:17,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:17,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:44:17,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:17,896 INFO L124 PetriNetUnfolderBase]: 11715/16033 cut-off events. [2025-02-06 12:44:17,897 INFO L125 PetriNetUnfolderBase]: For 12446/12446 co-relation queries the response was YES. [2025-02-06 12:44:17,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40647 conditions, 16033 events. 11715/16033 cut-off events. For 12446/12446 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 83727 event pairs, 2399 based on Foata normal form. 160/16179 useless extension candidates. Maximal degree in co-relation 40635. Up to 6144 conditions per place. [2025-02-06 12:44:17,990 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 105 selfloop transitions, 18 changer transitions 1/131 dead transitions. [2025-02-06 12:44:17,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 655 flow [2025-02-06 12:44:17,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:44:17,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:44:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2025-02-06 12:44:17,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-02-06 12:44:17,992 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 241 flow. Second operand 7 states and 210 transitions. [2025-02-06 12:44:17,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 655 flow [2025-02-06 12:44:18,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 131 transitions, 609 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-02-06 12:44:18,196 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 251 flow [2025-02-06 12:44:18,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2025-02-06 12:44:18,198 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-02-06 12:44:18,199 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 251 flow [2025-02-06 12:44:18,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:18,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:18,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:44:18,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:44:18,199 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:18,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash 829457402, now seen corresponding path program 1 times [2025-02-06 12:44:18,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:44:18,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958743699] [2025-02-06 12:44:18,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:44:18,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:44:18,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 12:44:18,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 12:44:18,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:44:18,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:18,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:44:18,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958743699] [2025-02-06 12:44:18,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958743699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:18,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:18,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:44:18,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957596061] [2025-02-06 12:44:18,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:18,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:44:18,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:44:18,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:44:18,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:44:18,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:44:18,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 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-02-06 12:44:18,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:18,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:44:18,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:20,597 INFO L124 PetriNetUnfolderBase]: 17091/23335 cut-off events. [2025-02-06 12:44:20,597 INFO L125 PetriNetUnfolderBase]: For 18204/18204 co-relation queries the response was YES. [2025-02-06 12:44:20,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59198 conditions, 23335 events. 17091/23335 cut-off events. For 18204/18204 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 127011 event pairs, 3207 based on Foata normal form. 16/23343 useless extension candidates. Maximal degree in co-relation 59185. Up to 12841 conditions per place. [2025-02-06 12:44:20,762 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 78 selfloop transitions, 6 changer transitions 27/118 dead transitions. [2025-02-06 12:44:20,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 118 transitions, 731 flow [2025-02-06 12:44:20,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:44:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:44:20,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2025-02-06 12:44:20,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-02-06 12:44:20,764 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 251 flow. Second operand 6 states and 160 transitions. [2025-02-06 12:44:20,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 118 transitions, 731 flow [2025-02-06 12:44:21,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 118 transitions, 542 flow, removed 34 selfloop flow, removed 10 redundant places. [2025-02-06 12:44:21,149 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 190 flow [2025-02-06 12:44:21,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2025-02-06 12:44:21,150 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2025-02-06 12:44:21,150 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 190 flow [2025-02-06 12:44:21,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 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-02-06 12:44:21,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:21,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:44:21,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:44:21,150 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:21,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:21,151 INFO L85 PathProgramCache]: Analyzing trace with hash 64475178, now seen corresponding path program 2 times [2025-02-06 12:44:21,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:44:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921177131] [2025-02-06 12:44:21,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:44:21,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:44:21,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-02-06 12:44:21,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 12:44:21,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:44:21,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:22,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:44:22,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921177131] [2025-02-06 12:44:22,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921177131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:22,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:22,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:44:22,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911980923] [2025-02-06 12:44:22,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:22,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:44:22,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:44:22,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:44:22,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:44:22,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:44:22,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 190 flow. Second operand has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:22,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:22,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:44:22,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:23,764 INFO L124 PetriNetUnfolderBase]: 9747/13540 cut-off events. [2025-02-06 12:44:23,765 INFO L125 PetriNetUnfolderBase]: For 2623/2623 co-relation queries the response was YES. [2025-02-06 12:44:23,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31970 conditions, 13540 events. 9747/13540 cut-off events. For 2623/2623 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 68001 event pairs, 1939 based on Foata normal form. 16/13552 useless extension candidates. Maximal degree in co-relation 31958. Up to 5850 conditions per place. [2025-02-06 12:44:23,821 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 99 selfloop transitions, 3 changer transitions 51/160 dead transitions. [2025-02-06 12:44:23,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 160 transitions, 808 flow [2025-02-06 12:44:23,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:44:23,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:44:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2025-02-06 12:44:23,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-02-06 12:44:23,823 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 190 flow. Second operand 8 states and 209 transitions. [2025-02-06 12:44:23,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 160 transitions, 808 flow [2025-02-06 12:44:23,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 160 transitions, 790 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-06 12:44:23,829 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 196 flow [2025-02-06 12:44:23,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=196, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2025-02-06 12:44:23,835 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2025-02-06 12:44:23,835 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 196 flow [2025-02-06 12:44:23,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:23,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:23,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:44:23,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:44:23,835 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:23,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2069154190, now seen corresponding path program 3 times [2025-02-06 12:44:23,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:44:23,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5503723] [2025-02-06 12:44:23,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:44:23,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:44:23,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 1 equivalence classes. [2025-02-06 12:44:23,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 12:44:23,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:44:23,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:24,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:44:24,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5503723] [2025-02-06 12:44:24,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5503723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:24,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:24,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:44:24,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051047370] [2025-02-06 12:44:24,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:24,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:44:24,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:44:24,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:44:24,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:44:24,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:44:24,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 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-02-06 12:44:24,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:24,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:44:24,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:25,484 INFO L124 PetriNetUnfolderBase]: 12899/17951 cut-off events. [2025-02-06 12:44:25,484 INFO L125 PetriNetUnfolderBase]: For 6742/6742 co-relation queries the response was YES. [2025-02-06 12:44:25,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43876 conditions, 17951 events. 12899/17951 cut-off events. For 6742/6742 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 95447 event pairs, 2211 based on Foata normal form. 16/17956 useless extension candidates. Maximal degree in co-relation 43861. Up to 10044 conditions per place. [2025-02-06 12:44:25,627 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 58 selfloop transitions, 1 changer transitions 57/123 dead transitions. [2025-02-06 12:44:25,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 123 transitions, 633 flow [2025-02-06 12:44:25,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:44:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:44:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2025-02-06 12:44:25,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2025-02-06 12:44:25,629 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 196 flow. Second operand 6 states and 158 transitions. [2025-02-06 12:44:25,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 123 transitions, 633 flow [2025-02-06 12:44:25,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 123 transitions, 612 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-06 12:44:25,638 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 193 flow [2025-02-06 12:44:25,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2025-02-06 12:44:25,639 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2025-02-06 12:44:25,639 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 193 flow [2025-02-06 12:44:25,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 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-02-06 12:44:25,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:25,640 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:44:25,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:44:25,640 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:25,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:25,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1877587974, now seen corresponding path program 4 times [2025-02-06 12:44:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:44:25,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629065166] [2025-02-06 12:44:25,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:44:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:44:25,652 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-02-06 12:44:25,664 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 12:44:25,664 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 12:44:25,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:25,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:44:25,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629065166] [2025-02-06 12:44:25,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629065166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:25,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:25,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:44:25,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891792360] [2025-02-06 12:44:25,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:25,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:44:25,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:44:25,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:44:25,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:44:25,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-02-06 12:44:25,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:25,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:25,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-02-06 12:44:25,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:27,198 INFO L124 PetriNetUnfolderBase]: 10809/15382 cut-off events. [2025-02-06 12:44:27,199 INFO L125 PetriNetUnfolderBase]: For 3996/3996 co-relation queries the response was YES. [2025-02-06 12:44:27,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37059 conditions, 15382 events. 10809/15382 cut-off events. For 3996/3996 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 81917 event pairs, 3497 based on Foata normal form. 16/15393 useless extension candidates. Maximal degree in co-relation 37044. Up to 8268 conditions per place. [2025-02-06 12:44:27,304 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 53 selfloop transitions, 1 changer transitions 80/140 dead transitions. [2025-02-06 12:44:27,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 140 transitions, 717 flow [2025-02-06 12:44:27,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:44:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:44:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2025-02-06 12:44:27,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2025-02-06 12:44:27,306 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 193 flow. Second operand 7 states and 180 transitions. [2025-02-06 12:44:27,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 140 transitions, 717 flow [2025-02-06 12:44:27,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 140 transitions, 704 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 12:44:27,314 INFO L231 Difference]: Finished difference. Result has 77 places, 55 transitions, 184 flow [2025-02-06 12:44:27,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=77, PETRI_TRANSITIONS=55} [2025-02-06 12:44:27,314 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 15 predicate places. [2025-02-06 12:44:27,314 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 55 transitions, 184 flow [2025-02-06 12:44:27,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:27,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:27,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:44:27,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:44:27,315 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:27,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash 506086108, now seen corresponding path program 5 times [2025-02-06 12:44:27,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:44:27,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020000288] [2025-02-06 12:44:27,316 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 12:44:27,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:44:27,324 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-02-06 12:44:27,383 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 12:44:27,384 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:44:27,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:44:27,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:44:27,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 12:44:27,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 12:44:27,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:44:27,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:44:27,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:44:27,508 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:44:27,509 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-02-06 12:44:27,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-02-06 12:44:27,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-02-06 12:44:27,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-02-06 12:44:27,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-02-06 12:44:27,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-02-06 12:44:27,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-02-06 12:44:27,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-02-06 12:44:27,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:44:27,513 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2025-02-06 12:44:27,597 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:44:27,597 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:44:27,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:44:27 BasicIcfg [2025-02-06 12:44:27,601 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:44:27,601 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:44:27,601 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:44:27,601 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:44:27,602 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:43:54" (3/4) ... [2025-02-06 12:44:27,603 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:44:27,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:44:27,605 INFO L158 Benchmark]: Toolchain (without parser) took 34157.56ms. Allocated memory was 167.8MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 121.2MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 4.6GB. Max. memory is 16.1GB. [2025-02-06 12:44:27,605 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:44:27,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.51ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 97.4MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:44:27,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.91ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 94.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:44:27,608 INFO L158 Benchmark]: Boogie Preprocessor took 36.51ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 91.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:44:27,608 INFO L158 Benchmark]: IcfgBuilder took 714.91ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 117.6MB in the end (delta: -26.0MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2025-02-06 12:44:27,609 INFO L158 Benchmark]: TraceAbstraction took 32952.79ms. Allocated memory was 167.8MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 117.6MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 4.6GB. Max. memory is 16.1GB. [2025-02-06 12:44:27,609 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 11.1GB. Free memory was 6.5GB in the beginning and 6.5GB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:44:27,610 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.19ms. Allocated memory is still 201.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.51ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 97.4MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.91ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 94.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.51ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 91.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 714.91ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 117.6MB in the end (delta: -26.0MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * TraceAbstraction took 32952.79ms. Allocated memory was 167.8MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 117.6MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 4.6GB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 11.1GB. Free memory was 6.5GB in the beginning and 6.5GB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1129; [L872] FCALL, FORK 0 pthread_create(&t1129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1129=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1130; [L874] FCALL, FORK 0 pthread_create(&t1130, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1129=-3, t1130=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1131; [L767] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t1131, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1129=-3, t1130=-2, t1131=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1132; [L878] FCALL, FORK 0 pthread_create(&t1132, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1129=-3, t1130=-2, t1131=-1, t1132=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L824] 4 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L827] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L830] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129=-3, t1130=-2, t1131=-1, t1132=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129=-3, t1130=-2, t1131=-1, t1132=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129=-3, t1130=-2, t1131=-1, t1132=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L893] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L17] 0 __assert_fail ("0", "mix043.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 874]: 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: 872]: 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: 876]: 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 9 procedures, 89 locations, 8 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: 32.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 28.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 906 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 898 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2206 IncrementalHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 5 mSDtfsCounter, 2206 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=6, InterpolantAutomatonStates: 55, 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.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 1478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:44:27,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix043.oepc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:44:30,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:44:30,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 12:44:30,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:44:30,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:44:30,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:44:30,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:44:30,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:44:30,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:44:30,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:44:30,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:44:30,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:44:30,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:44:30,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:44:30,976 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:44:30,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:44:30,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:44:30,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:44:30,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:44:30,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:44:30,977 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:44:30,977 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:44:30,977 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:44:30,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:44:30,977 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:44:30,977 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:44:30,977 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:44:30,977 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:44:30,977 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:44:30,977 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:44:30,977 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:44:30,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:44:30,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:44:30,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:44:30,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:44:30,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:44:30,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:44:30,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:44:30,978 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:44:30,978 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:44:30,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:44:30,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:44:30,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:44:30,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:44:30,979 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 [2025-02-06 12:44:31,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:44:31,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:44:31,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:44:31,224 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:44:31,224 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:44:31,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix043.oepc.i [2025-02-06 12:44:32,459 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81c90d297/ac2f546b0c7743239542360e290050bf/FLAGef00e784e [2025-02-06 12:44:32,704 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:44:32,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix043.oepc.i [2025-02-06 12:44:32,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81c90d297/ac2f546b0c7743239542360e290050bf/FLAGef00e784e [2025-02-06 12:44:33,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81c90d297/ac2f546b0c7743239542360e290050bf [2025-02-06 12:44:33,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:44:33,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:44:33,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:44:33,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:44:33,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:44:33,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:44:33" (1/1) ... [2025-02-06 12:44:33,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c42d88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33, skipping insertion in model container [2025-02-06 12:44:33,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:44:33" (1/1) ... [2025-02-06 12:44:33,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:44:33,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:44:33,252 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:44:33,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:44:33,325 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:44:33,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33 WrapperNode [2025-02-06 12:44:33,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:44:33,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:44:33,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:44:33,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:44:33,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33" (1/1) ... [2025-02-06 12:44:33,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33" (1/1) ... [2025-02-06 12:44:33,368 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2025-02-06 12:44:33,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:44:33,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:44:33,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:44:33,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:44:33,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33" (1/1) ... [2025-02-06 12:44:33,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33" (1/1) ... [2025-02-06 12:44:33,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33" (1/1) ... [2025-02-06 12:44:33,409 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-02-06 12:44:33,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33" (1/1) ... [2025-02-06 12:44:33,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33" (1/1) ... [2025-02-06 12:44:33,427 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33" (1/1) ... [2025-02-06 12:44:33,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33" (1/1) ... [2025-02-06 12:44:33,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33" (1/1) ... [2025-02-06 12:44:33,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33" (1/1) ... [2025-02-06 12:44:33,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:44:33,441 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:44:33,444 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:44:33,445 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:44:33,446 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33" (1/1) ... [2025-02-06 12:44:33,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:44:33,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:44:33,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:44:33,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:44:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:44:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:44:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:44:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:44:33,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:44:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:44:33,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:44:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:44:33,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:44:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-02-06 12:44:33,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-02-06 12:44:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:44:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:44:33,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:44:33,506 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:44:33,639 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:44:33,641 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:44:33,993 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:44:33,993 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:44:34,273 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:44:34,274 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:44:34,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:44:34 BoogieIcfgContainer [2025-02-06 12:44:34,274 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:44:34,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:44:34,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:44:34,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:44:34,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:44:33" (1/3) ... [2025-02-06 12:44:34,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:44:34, skipping insertion in model container [2025-02-06 12:44:34,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:44:33" (2/3) ... [2025-02-06 12:44:34,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:44:34, skipping insertion in model container [2025-02-06 12:44:34,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:44:34" (3/3) ... [2025-02-06 12:44:34,281 INFO L128 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2025-02-06 12:44:34,292 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:44:34,294 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix043.oepc.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:44:34,295 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:44:34,350 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:44:34,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2025-02-06 12:44:34,414 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-02-06 12:44:34,416 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:44:34,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-02-06 12:44:34,418 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2025-02-06 12:44:34,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2025-02-06 12:44:34,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:44:34,442 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;@7220f8d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:44:34,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 12:44:34,449 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:44:34,449 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-02-06 12:44:34,449 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:44:34,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:34,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:44:34,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:34,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:34,455 INFO L85 PathProgramCache]: Analyzing trace with hash 14078188, now seen corresponding path program 1 times [2025-02-06 12:44:34,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:44:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378442485] [2025-02-06 12:44:34,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:44:34,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:34,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:44:34,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:44:34,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:44:34,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:44:34,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:44:34,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:44:34,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:34,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:44:34,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:44:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:34,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:44:34,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:44:34,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378442485] [2025-02-06 12:44:34,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378442485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:34,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:34,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:44:34,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150560966] [2025-02-06 12:44:34,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:34,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:44:34,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:44:34,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:44:34,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:44:34,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:44:34,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:34,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:34,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:44:34,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:39,855 INFO L124 PetriNetUnfolderBase]: 57803/76548 cut-off events. [2025-02-06 12:44:39,855 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2025-02-06 12:44:40,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152672 conditions, 76548 events. 57803/76548 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 2146. Compared 472274 event pairs, 7163 based on Foata normal form. 3420/79926 useless extension candidates. Maximal degree in co-relation 152660. Up to 65471 conditions per place. [2025-02-06 12:44:40,344 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 67 selfloop transitions, 2 changer transitions 2/79 dead transitions. [2025-02-06 12:44:40,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 321 flow [2025-02-06 12:44:40,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:44:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:44:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-02-06 12:44:40,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2025-02-06 12:44:40,360 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 112 transitions. [2025-02-06 12:44:40,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 321 flow [2025-02-06 12:44:40,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 79 transitions, 314 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:44:40,375 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2025-02-06 12:44:40,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, 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=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-02-06 12:44:40,382 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2025-02-06 12:44:40,382 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2025-02-06 12:44:40,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:40,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:40,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:44:40,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 12:44:40,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:40,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:40,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash -638461762, now seen corresponding path program 1 times [2025-02-06 12:44:40,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:44:40,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939610018] [2025-02-06 12:44:40,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:44:40,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:40,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:44:40,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:44:40,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:44:40,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:44:40,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:44:40,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:44:40,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:40,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:44:40,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:44:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:40,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:44:40,699 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:44:40,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939610018] [2025-02-06 12:44:40,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939610018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:40,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:40,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:44:40,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992869617] [2025-02-06 12:44:40,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:40,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:44:40,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:44:40,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:44:40,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:44:40,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-02-06 12:44:40,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:40,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:40,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-02-06 12:44:40,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:44,836 INFO L124 PetriNetUnfolderBase]: 51971/72409 cut-off events. [2025-02-06 12:44:44,837 INFO L125 PetriNetUnfolderBase]: For 2678/2678 co-relation queries the response was YES. [2025-02-06 12:44:45,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143649 conditions, 72409 events. 51971/72409 cut-off events. For 2678/2678 co-relation queries the response was YES. Maximal size of possible extension queue 2166. Compared 473800 event pairs, 51971 based on Foata normal form. 1728/73891 useless extension candidates. Maximal degree in co-relation 143639. Up to 68040 conditions per place. [2025-02-06 12:44:45,276 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 36 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-02-06 12:44:45,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 178 flow [2025-02-06 12:44:45,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:44:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:44:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-02-06 12:44:45,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-02-06 12:44:45,277 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 72 transitions. [2025-02-06 12:44:45,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 178 flow [2025-02-06 12:44:45,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:44:45,279 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2025-02-06 12:44:45,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-02-06 12:44:45,280 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-02-06 12:44:45,280 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2025-02-06 12:44:45,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:45,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:45,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:44:45,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:44:45,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:45,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:45,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:45,486 INFO L85 PathProgramCache]: Analyzing trace with hash -638461212, now seen corresponding path program 1 times [2025-02-06 12:44:45,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:44:45,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447681093] [2025-02-06 12:44:45,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:44:45,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:45,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:44:45,489 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:44:45,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:44:45,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:44:45,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:44:45,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:44:45,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:45,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:44:45,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:44:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:45,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:44:45,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:44:45,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447681093] [2025-02-06 12:44:45,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447681093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:45,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:45,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:44:45,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243891562] [2025-02-06 12:44:45,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:45,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:44:45,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:44:45,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:44:45,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:44:45,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:44:45,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:45,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:45,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:44:45,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:49,291 INFO L124 PetriNetUnfolderBase]: 41411/59249 cut-off events. [2025-02-06 12:44:49,292 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:44:49,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114947 conditions, 59249 events. 41411/59249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1839. Compared 405123 event pairs, 5075 based on Foata normal form. 1728/60963 useless extension candidates. Maximal degree in co-relation 114941. Up to 33841 conditions per place. [2025-02-06 12:44:49,926 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 78 selfloop transitions, 6 changer transitions 1/92 dead transitions. [2025-02-06 12:44:49,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 370 flow [2025-02-06 12:44:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:44:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:44:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-02-06 12:44:49,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-02-06 12:44:49,928 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 4 states and 135 transitions. [2025-02-06 12:44:49,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 370 flow [2025-02-06 12:44:49,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:44:49,930 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 139 flow [2025-02-06 12:44:49,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-02-06 12:44:49,930 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2025-02-06 12:44:49,931 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 139 flow [2025-02-06 12:44:49,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:49,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:49,931 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-02-06 12:44:49,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:44:50,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:50,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:50,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:50,133 INFO L85 PathProgramCache]: Analyzing trace with hash -635298828, now seen corresponding path program 1 times [2025-02-06 12:44:50,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:44:50,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [609443390] [2025-02-06 12:44:50,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:44:50,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:50,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:44:50,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:44:50,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:44:50,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:44:50,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:44:50,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:44:50,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:50,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:44:50,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:44:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:50,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:44:50,249 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:44:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609443390] [2025-02-06 12:44:50,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609443390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:50,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:50,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:44:50,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677908168] [2025-02-06 12:44:50,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:50,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:44:50,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:44:50,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:44:50,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:44:50,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:44:50,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:50,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:50,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:44:50,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:52,496 INFO L124 PetriNetUnfolderBase]: 25795/36913 cut-off events. [2025-02-06 12:44:52,496 INFO L125 PetriNetUnfolderBase]: For 7038/7038 co-relation queries the response was YES. [2025-02-06 12:44:52,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81794 conditions, 36913 events. 25795/36913 cut-off events. For 7038/7038 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 232530 event pairs, 2975 based on Foata normal form. 1344/38243 useless extension candidates. Maximal degree in co-relation 81785. Up to 14833 conditions per place. [2025-02-06 12:44:52,723 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 101 selfloop transitions, 10 changer transitions 1/119 dead transitions. [2025-02-06 12:44:52,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 119 transitions, 534 flow [2025-02-06 12:44:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:44:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:44:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2025-02-06 12:44:52,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6327272727272727 [2025-02-06 12:44:52,725 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 139 flow. Second operand 5 states and 174 transitions. [2025-02-06 12:44:52,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 119 transitions, 534 flow [2025-02-06 12:44:52,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 119 transitions, 523 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:44:52,736 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 191 flow [2025-02-06 12:44:52,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2025-02-06 12:44:52,737 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2025-02-06 12:44:52,737 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 191 flow [2025-02-06 12:44:52,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:52,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:52,737 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-02-06 12:44:52,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 12:44:52,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:52,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:52,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash -699756655, now seen corresponding path program 1 times [2025-02-06 12:44:52,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:44:52,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756571782] [2025-02-06 12:44:52,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:44:52,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:52,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:44:52,941 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:44:52,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:44:53,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 12:44:53,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 12:44:53,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:44:53,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:53,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:44:53,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:44:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:53,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:44:53,112 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:44:53,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756571782] [2025-02-06 12:44:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756571782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:53,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:53,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:44:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048311172] [2025-02-06 12:44:53,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:53,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:44:53,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:44:53,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:44:53,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:44:53,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:44:53,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-02-06 12:44:53,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:53,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:44:53,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:54,717 INFO L124 PetriNetUnfolderBase]: 15171/21265 cut-off events. [2025-02-06 12:44:54,718 INFO L125 PetriNetUnfolderBase]: For 12934/12934 co-relation queries the response was YES. [2025-02-06 12:44:54,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51862 conditions, 21265 events. 15171/21265 cut-off events. For 12934/12934 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 117208 event pairs, 2591 based on Foata normal form. 640/21891 useless extension candidates. Maximal degree in co-relation 51851. Up to 6144 conditions per place. [2025-02-06 12:44:54,893 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 122 selfloop transitions, 14 changer transitions 1/144 dead transitions. [2025-02-06 12:44:54,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 697 flow [2025-02-06 12:44:54,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:44:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:44:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2025-02-06 12:44:54,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6393939393939394 [2025-02-06 12:44:54,894 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 191 flow. Second operand 6 states and 211 transitions. [2025-02-06 12:44:54,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 697 flow [2025-02-06 12:44:55,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 144 transitions, 667 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 12:44:55,097 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 241 flow [2025-02-06 12:44:55,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-02-06 12:44:55,098 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-02-06 12:44:55,098 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 241 flow [2025-02-06 12:44:55,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-02-06 12:44:55,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:55,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:44:55,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:44:55,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:55,299 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:55,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2004066516, now seen corresponding path program 1 times [2025-02-06 12:44:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:44:55,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [144764054] [2025-02-06 12:44:55,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:44:55,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:55,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:44:55,302 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:44:55,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:44:55,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 12:44:55,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 12:44:55,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:44:55,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:55,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:44:55,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:44:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:55,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:44:55,458 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:44:55,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144764054] [2025-02-06 12:44:55,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144764054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:55,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:55,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:44:55,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445672404] [2025-02-06 12:44:55,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:55,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:44:55,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:44:55,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:44:55,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:44:55,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:44:55,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:55,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:55,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:44:55,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:56,650 INFO L124 PetriNetUnfolderBase]: 11715/16033 cut-off events. [2025-02-06 12:44:56,651 INFO L125 PetriNetUnfolderBase]: For 12446/12446 co-relation queries the response was YES. [2025-02-06 12:44:56,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40647 conditions, 16033 events. 11715/16033 cut-off events. For 12446/12446 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 83757 event pairs, 2399 based on Foata normal form. 160/16179 useless extension candidates. Maximal degree in co-relation 40635. Up to 6144 conditions per place. [2025-02-06 12:44:56,759 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 105 selfloop transitions, 18 changer transitions 1/131 dead transitions. [2025-02-06 12:44:56,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 655 flow [2025-02-06 12:44:56,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:44:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:44:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2025-02-06 12:44:56,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-02-06 12:44:56,761 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 241 flow. Second operand 7 states and 210 transitions. [2025-02-06 12:44:56,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 655 flow [2025-02-06 12:44:56,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 131 transitions, 609 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-02-06 12:44:56,981 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 251 flow [2025-02-06 12:44:56,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2025-02-06 12:44:56,982 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-02-06 12:44:56,982 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 251 flow [2025-02-06 12:44:56,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:56,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:56,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:44:56,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:44:57,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:57,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:57,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:57,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1363753156, now seen corresponding path program 1 times [2025-02-06 12:44:57,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:44:57,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [420370954] [2025-02-06 12:44:57,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:44:57,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:57,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:44:57,187 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:44:57,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:44:57,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 12:44:57,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 12:44:57,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:44:57,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:57,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:44:57,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:44:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:57,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:44:57,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:44:57,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420370954] [2025-02-06 12:44:57,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420370954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:57,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:57,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:44:57,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395912519] [2025-02-06 12:44:57,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:57,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:44:57,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:44:57,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:44:57,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:44:57,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:44:57,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 251 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:57,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:57,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:44:57,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:44:58,954 INFO L124 PetriNetUnfolderBase]: 17429/23858 cut-off events. [2025-02-06 12:44:58,954 INFO L125 PetriNetUnfolderBase]: For 18154/18154 co-relation queries the response was YES. [2025-02-06 12:44:59,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60901 conditions, 23858 events. 17429/23858 cut-off events. For 18154/18154 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 133383 event pairs, 1941 based on Foata normal form. 16/23867 useless extension candidates. Maximal degree in co-relation 60888. Up to 12868 conditions per place. [2025-02-06 12:44:59,106 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 74 selfloop transitions, 1 changer transitions 55/137 dead transitions. [2025-02-06 12:44:59,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 137 transitions, 861 flow [2025-02-06 12:44:59,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:44:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:44:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2025-02-06 12:44:59,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2025-02-06 12:44:59,107 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 251 flow. Second operand 7 states and 185 transitions. [2025-02-06 12:44:59,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 137 transitions, 861 flow [2025-02-06 12:44:59,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 137 transitions, 636 flow, removed 34 selfloop flow, removed 10 redundant places. [2025-02-06 12:44:59,394 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 168 flow [2025-02-06 12:44:59,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2025-02-06 12:44:59,395 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2025-02-06 12:44:59,395 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 168 flow [2025-02-06 12:44:59,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:59,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:44:59,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:44:59,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 12:44:59,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:59,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:44:59,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:44:59,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1792923094, now seen corresponding path program 2 times [2025-02-06 12:44:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:44:59,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108485029] [2025-02-06 12:44:59,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:44:59,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:44:59,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:44:59,602 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:44:59,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:44:59,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-02-06 12:44:59,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 12:44:59,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:44:59,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:44:59,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:44:59,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:44:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:44:59,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:44:59,775 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:44:59,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108485029] [2025-02-06 12:44:59,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108485029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:44:59,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:44:59,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:44:59,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758455516] [2025-02-06 12:44:59,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:44:59,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:44:59,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:44:59,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:44:59,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:44:59,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:44:59,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 168 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:44:59,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:44:59,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:44:59,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:01,201 INFO L124 PetriNetUnfolderBase]: 16457/22859 cut-off events. [2025-02-06 12:45:01,201 INFO L125 PetriNetUnfolderBase]: For 4245/4245 co-relation queries the response was YES. [2025-02-06 12:45:01,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51251 conditions, 22859 events. 16457/22859 cut-off events. For 4245/4245 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 129770 event pairs, 1543 based on Foata normal form. 16/22855 useless extension candidates. Maximal degree in co-relation 51239. Up to 12258 conditions per place. [2025-02-06 12:45:01,397 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 70 selfloop transitions, 1 changer transitions 54/132 dead transitions. [2025-02-06 12:45:01,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 132 transitions, 636 flow [2025-02-06 12:45:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:45:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:45:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2025-02-06 12:45:01,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2025-02-06 12:45:01,399 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 168 flow. Second operand 7 states and 180 transitions. [2025-02-06 12:45:01,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 132 transitions, 636 flow [2025-02-06 12:45:01,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 132 transitions, 620 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-06 12:45:01,408 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 172 flow [2025-02-06 12:45:01,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=172, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2025-02-06 12:45:01,411 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2025-02-06 12:45:01,411 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 172 flow [2025-02-06 12:45:01,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:01,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:01,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:45:01,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 12:45:01,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:01,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:45:01,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:01,613 INFO L85 PathProgramCache]: Analyzing trace with hash 445404226, now seen corresponding path program 3 times [2025-02-06 12:45:01,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:45:01,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1343072865] [2025-02-06 12:45:01,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:45:01,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:01,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:45:01,622 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:45:01,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:45:01,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 1 equivalence classes. [2025-02-06 12:45:01,725 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 12:45:01,725 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:45:01,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:01,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 12:45:01,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:45:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:02,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:45:02,244 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:45:02,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343072865] [2025-02-06 12:45:02,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343072865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:02,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:02,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:45:02,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135152946] [2025-02-06 12:45:02,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:02,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:45:02,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:45:02,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:45:02,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:45:02,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:45:02,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 172 flow. Second operand has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:02,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:02,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:45:02,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:04,264 INFO L124 PetriNetUnfolderBase]: 14387/20382 cut-off events. [2025-02-06 12:45:04,265 INFO L125 PetriNetUnfolderBase]: For 5723/5726 co-relation queries the response was YES. [2025-02-06 12:45:04,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47479 conditions, 20382 events. 14387/20382 cut-off events. For 5723/5726 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 118230 event pairs, 4293 based on Foata normal form. 16/20391 useless extension candidates. Maximal degree in co-relation 47466. Up to 8054 conditions per place. [2025-02-06 12:45:04,434 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 93 selfloop transitions, 5 changer transitions 82/187 dead transitions. [2025-02-06 12:45:04,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 187 transitions, 936 flow [2025-02-06 12:45:04,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:45:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:45:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 255 transitions. [2025-02-06 12:45:04,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4636363636363636 [2025-02-06 12:45:04,436 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 172 flow. Second operand 10 states and 255 transitions. [2025-02-06 12:45:04,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 187 transitions, 936 flow [2025-02-06 12:45:04,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 187 transitions, 918 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-06 12:45:04,445 INFO L231 Difference]: Finished difference. Result has 78 places, 58 transitions, 194 flow [2025-02-06 12:45:04,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=194, PETRI_PLACES=78, PETRI_TRANSITIONS=58} [2025-02-06 12:45:04,446 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 16 predicate places. [2025-02-06 12:45:04,446 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 58 transitions, 194 flow [2025-02-06 12:45:04,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:04,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:04,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:45:04,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 12:45:04,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:04,648 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:45:04,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2027727462, now seen corresponding path program 4 times [2025-02-06 12:45:04,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:45:04,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [225107124] [2025-02-06 12:45:04,649 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:45:04,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:04,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:45:04,651 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:45:04,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 12:45:04,708 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-02-06 12:45:04,722 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 39 statements. [2025-02-06 12:45:04,722 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 12:45:04,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:04,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 12:45:04,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:45:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:04,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:45:04,892 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:45:04,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225107124] [2025-02-06 12:45:04,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225107124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:04,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:04,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:45:04,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070597620] [2025-02-06 12:45:04,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:04,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:45:04,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:45:04,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:45:04,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:45:04,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:45:04,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 58 transitions, 194 flow. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:04,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:04,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:45:04,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:06,653 INFO L124 PetriNetUnfolderBase]: 15325/21810 cut-off events. [2025-02-06 12:45:06,654 INFO L125 PetriNetUnfolderBase]: For 7573/7576 co-relation queries the response was YES. [2025-02-06 12:45:06,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54472 conditions, 21810 events. 15325/21810 cut-off events. For 7573/7576 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 126265 event pairs, 7449 based on Foata normal form. 16/21816 useless extension candidates. Maximal degree in co-relation 54456. Up to 11185 conditions per place. [2025-02-06 12:45:06,848 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 101 selfloop transitions, 6 changer transitions 55/169 dead transitions. [2025-02-06 12:45:06,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 169 transitions, 870 flow [2025-02-06 12:45:06,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:45:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:45:06,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2025-02-06 12:45:06,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49772727272727274 [2025-02-06 12:45:06,850 INFO L175 Difference]: Start difference. First operand has 78 places, 58 transitions, 194 flow. Second operand 8 states and 219 transitions. [2025-02-06 12:45:06,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 169 transitions, 870 flow [2025-02-06 12:45:06,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 169 transitions, 841 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-02-06 12:45:06,862 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 238 flow [2025-02-06 12:45:06,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2025-02-06 12:45:06,863 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 18 predicate places. [2025-02-06 12:45:06,863 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 238 flow [2025-02-06 12:45:06,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:06,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:06,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:45:06,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 12:45:07,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:07,069 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:45:07,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:07,070 INFO L85 PathProgramCache]: Analyzing trace with hash 34952508, now seen corresponding path program 5 times [2025-02-06 12:45:07,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:45:07,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036440155] [2025-02-06 12:45:07,070 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 12:45:07,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:07,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:45:07,072 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:45:07,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 12:45:07,136 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-02-06 12:45:07,160 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 12:45:07,160 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:45:07,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:07,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 12:45:07,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:45:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:07,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:45:07,215 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:45:07,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036440155] [2025-02-06 12:45:07,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036440155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:07,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:07,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:45:07,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79665660] [2025-02-06 12:45:07,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:07,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:45:07,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:45:07,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:45:07,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:45:07,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-02-06 12:45:07,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 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-02-06 12:45:07,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:07,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-02-06 12:45:07,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand