./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix008.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix008.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:41:55,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:41:55,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:41:55,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:41:55,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:41:55,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:41:55,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:41:55,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:41:55,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:41:55,712 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:41:55,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:41:55,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:41:55,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:41:55,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:41:55,714 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:41:55,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:41:55,714 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:41:55,714 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:41:55,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:41:55,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:41:55,714 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:41:55,714 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:41:55,714 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:41:55,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:41:55,714 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:41:55,714 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:41:55,714 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:41:55,715 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:41:55,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:41:55,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:41:55,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:41:55,715 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 -> 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8 [2025-01-10 00:41:55,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:41:55,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:41:55,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:41:55,944 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:41:55,944 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:41:55,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix008.opt.i [2025-01-10 00:41:57,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5903335bb/803eeacac4c546ae980331838b2ab453/FLAGc2aee9683 [2025-01-10 00:41:57,442 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:41:57,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix008.opt.i [2025-01-10 00:41:57,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5903335bb/803eeacac4c546ae980331838b2ab453/FLAGc2aee9683 [2025-01-10 00:41:57,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5903335bb/803eeacac4c546ae980331838b2ab453 [2025-01-10 00:41:57,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:41:57,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:41:57,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:41:57,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:41:57,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:41:57,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:41:57" (1/1) ... [2025-01-10 00:41:57,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758d9311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:57, skipping insertion in model container [2025-01-10 00:41:57,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:41:57" (1/1) ... [2025-01-10 00:41:57,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:41:58,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:41:58,095 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:41:58,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:41:58,241 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:41:58,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58 WrapperNode [2025-01-10 00:41:58,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:41:58,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:41:58,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:41:58,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:41:58,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58" (1/1) ... [2025-01-10 00:41:58,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58" (1/1) ... [2025-01-10 00:41:58,306 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2025-01-10 00:41:58,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:41:58,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:41:58,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:41:58,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:41:58,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58" (1/1) ... [2025-01-10 00:41:58,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58" (1/1) ... [2025-01-10 00:41:58,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58" (1/1) ... [2025-01-10 00:41:58,368 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:41:58,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58" (1/1) ... [2025-01-10 00:41:58,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58" (1/1) ... [2025-01-10 00:41:58,392 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58" (1/1) ... [2025-01-10 00:41:58,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58" (1/1) ... [2025-01-10 00:41:58,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58" (1/1) ... [2025-01-10 00:41:58,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58" (1/1) ... [2025-01-10 00:41:58,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58" (1/1) ... [2025-01-10 00:41:58,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:41:58,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:41:58,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:41:58,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:41:58,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58" (1/1) ... [2025-01-10 00:41:58,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:41:58,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:41:58,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:41:58,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:41:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:41:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:41:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:41:58,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:41:58,510 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:41:58,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:41:58,510 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:41:58,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:41:58,510 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-10 00:41:58,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-10 00:41:58,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:41:58,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:41:58,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:41:58,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:41:58,514 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:41:58,697 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:41:58,703 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:41:59,244 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:41:59,245 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:41:59,543 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:41:59,546 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:41:59,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:41:59 BoogieIcfgContainer [2025-01-10 00:41:59,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:41:59,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:41:59,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:41:59,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:41:59,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:41:57" (1/3) ... [2025-01-10 00:41:59,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44641180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:41:59, skipping insertion in model container [2025-01-10 00:41:59,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:58" (2/3) ... [2025-01-10 00:41:59,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44641180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:41:59, skipping insertion in model container [2025-01-10 00:41:59,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:41:59" (3/3) ... [2025-01-10 00:41:59,559 INFO L128 eAbstractionObserver]: Analyzing ICFG mix008.opt.i [2025-01-10 00:41:59,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:41:59,576 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix008.opt.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:41:59,576 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:41:59,630 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:41:59,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2025-01-10 00:41:59,686 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-01-10 00:41:59,688 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:59,691 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 105 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-01-10 00:41:59,691 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2025-01-10 00:41:59,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2025-01-10 00:41:59,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:41:59,714 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;@69d0af05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:41:59,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:41:59,725 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:41:59,725 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-01-10 00:41:59,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:59,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:59,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:59,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:59,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:59,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1776517179, now seen corresponding path program 1 times [2025-01-10 00:41:59,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:59,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519359415] [2025-01-10 00:41:59,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:59,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:59,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:41:59,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:41:59,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:59,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:00,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:00,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519359415] [2025-01-10 00:42:00,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519359415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:00,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:00,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:42:00,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275787196] [2025-01-10 00:42:00,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:00,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:42:00,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:00,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:42:00,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:42:00,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2025-01-10 00:42:00,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:00,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:00,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2025-01-10 00:42:00,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:00,559 INFO L124 PetriNetUnfolderBase]: 1175/2003 cut-off events. [2025-01-10 00:42:00,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:00,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 2003 events. 1175/2003 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 14373 event pairs, 199 based on Foata normal form. 120/2089 useless extension candidates. Maximal degree in co-relation 3727. Up to 1361 conditions per place. [2025-01-10 00:42:00,584 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 30 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2025-01-10 00:42:00,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 196 flow [2025-01-10 00:42:00,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:42:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:42:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-01-10 00:42:00,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7454545454545455 [2025-01-10 00:42:00,597 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 123 transitions. [2025-01-10 00:42:00,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 196 flow [2025-01-10 00:42:00,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:42:00,605 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2025-01-10 00:42:00,607 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-01-10 00:42:00,610 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2025-01-10 00:42:00,611 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2025-01-10 00:42:00,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:00,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:00,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:00,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:42:00,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:00,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:00,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1913835471, now seen corresponding path program 1 times [2025-01-10 00:42:00,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:00,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27068379] [2025-01-10 00:42:00,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:00,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:00,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:42:00,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:42:00,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:00,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:00,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:00,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27068379] [2025-01-10 00:42:00,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27068379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:00,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:00,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:42:00,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386534775] [2025-01-10 00:42:00,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:00,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:42:00,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:00,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:42:00,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:42:00,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2025-01-10 00:42:00,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-01-10 00:42:00,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:00,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2025-01-10 00:42:00,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:00,935 INFO L124 PetriNetUnfolderBase]: 1027/1867 cut-off events. [2025-01-10 00:42:00,936 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-01-10 00:42:00,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3477 conditions, 1867 events. 1027/1867 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13914 event pairs, 1027 based on Foata normal form. 60/1881 useless extension candidates. Maximal degree in co-relation 3467. Up to 1484 conditions per place. [2025-01-10 00:42:00,947 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 20 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-01-10 00:42:00,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 146 flow [2025-01-10 00:42:00,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:42:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:42:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-01-10 00:42:00,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2025-01-10 00:42:00,948 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 104 transitions. [2025-01-10 00:42:00,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 146 flow [2025-01-10 00:42:00,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:42:00,950 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2025-01-10 00:42:00,950 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-01-10 00:42:00,950 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-01-10 00:42:00,950 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2025-01-10 00:42:00,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-01-10 00:42:00,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:00,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:00,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:42:00,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:00,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:00,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1913836789, now seen corresponding path program 1 times [2025-01-10 00:42:00,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:00,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382724016] [2025-01-10 00:42:00,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:00,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:00,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:42:00,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:42:00,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:00,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:01,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:01,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382724016] [2025-01-10 00:42:01,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382724016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:01,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:01,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:42:01,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161123892] [2025-01-10 00:42:01,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:01,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:42:01,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:01,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:42:01,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:42:01,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 00:42:01,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:01,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:01,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 00:42:01,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:03,975 INFO L124 PetriNetUnfolderBase]: 20301/30507 cut-off events. [2025-01-10 00:42:03,975 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:04,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58351 conditions, 30507 events. 20301/30507 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1730. Compared 237916 event pairs, 4674 based on Foata normal form. 0/29580 useless extension candidates. Maximal degree in co-relation 58345. Up to 10621 conditions per place. [2025-01-10 00:42:04,205 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 42 selfloop transitions, 9 changer transitions 91/157 dead transitions. [2025-01-10 00:42:04,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 157 transitions, 612 flow [2025-01-10 00:42:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:42:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:42:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 324 transitions. [2025-01-10 00:42:04,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2025-01-10 00:42:04,211 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 9 states and 324 transitions. [2025-01-10 00:42:04,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 157 transitions, 612 flow [2025-01-10 00:42:04,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 157 transitions, 611 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:42:04,219 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 221 flow [2025-01-10 00:42:04,220 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=221, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2025-01-10 00:42:04,221 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2025-01-10 00:42:04,222 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 221 flow [2025-01-10 00:42:04,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:04,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:04,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:04,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:42:04,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:04,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:04,224 INFO L85 PathProgramCache]: Analyzing trace with hash -229067602, now seen corresponding path program 1 times [2025-01-10 00:42:04,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:04,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71770161] [2025-01-10 00:42:04,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:04,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:04,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:42:04,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:42:04,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:04,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:04,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:04,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71770161] [2025-01-10 00:42:04,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71770161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:04,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:04,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:42:04,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805295809] [2025-01-10 00:42:04,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:04,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:42:04,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:04,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:42:04,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:42:04,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2025-01-10 00:42:04,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:04,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:04,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2025-01-10 00:42:04,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:06,373 INFO L124 PetriNetUnfolderBase]: 10061/17731 cut-off events. [2025-01-10 00:42:06,373 INFO L125 PetriNetUnfolderBase]: For 21418/22698 co-relation queries the response was YES. [2025-01-10 00:42:06,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50268 conditions, 17731 events. 10061/17731 cut-off events. For 21418/22698 co-relation queries the response was YES. Maximal size of possible extension queue 1123. Compared 158001 event pairs, 2525 based on Foata normal form. 653/16971 useless extension candidates. Maximal degree in co-relation 50253. Up to 7526 conditions per place. [2025-01-10 00:42:06,488 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 35 selfloop transitions, 3 changer transitions 41/104 dead transitions. [2025-01-10 00:42:06,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 104 transitions, 605 flow [2025-01-10 00:42:06,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:42:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:42:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 244 transitions. [2025-01-10 00:42:06,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6337662337662338 [2025-01-10 00:42:06,491 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 221 flow. Second operand 7 states and 244 transitions. [2025-01-10 00:42:06,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 104 transitions, 605 flow [2025-01-10 00:42:06,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 104 transitions, 535 flow, removed 17 selfloop flow, removed 4 redundant places. [2025-01-10 00:42:06,526 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 206 flow [2025-01-10 00:42:06,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=206, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2025-01-10 00:42:06,527 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2025-01-10 00:42:06,527 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 206 flow [2025-01-10 00:42:06,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:06,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:06,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:06,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:42:06,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:06,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:06,528 INFO L85 PathProgramCache]: Analyzing trace with hash 611903499, now seen corresponding path program 1 times [2025-01-10 00:42:06,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:06,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494086720] [2025-01-10 00:42:06,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:06,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:06,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:42:06,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:42:06,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:06,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:06,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:06,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:06,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494086720] [2025-01-10 00:42:06,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494086720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:06,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:06,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:42:06,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813524653] [2025-01-10 00:42:06,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:06,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:42:06,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:06,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:42:06,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:42:06,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 00:42:06,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:06,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:06,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 00:42:06,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:08,537 INFO L124 PetriNetUnfolderBase]: 12092/19241 cut-off events. [2025-01-10 00:42:08,538 INFO L125 PetriNetUnfolderBase]: For 26651/26651 co-relation queries the response was YES. [2025-01-10 00:42:08,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55736 conditions, 19241 events. 12092/19241 cut-off events. For 26651/26651 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 149172 event pairs, 2201 based on Foata normal form. 380/19513 useless extension candidates. Maximal degree in co-relation 55718. Up to 8070 conditions per place. [2025-01-10 00:42:08,669 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 62 selfloop transitions, 13 changer transitions 70/160 dead transitions. [2025-01-10 00:42:08,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 160 transitions, 969 flow [2025-01-10 00:42:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:42:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:42:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 344 transitions. [2025-01-10 00:42:08,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6254545454545455 [2025-01-10 00:42:08,671 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 206 flow. Second operand 10 states and 344 transitions. [2025-01-10 00:42:08,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 160 transitions, 969 flow [2025-01-10 00:42:08,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 160 transitions, 933 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-01-10 00:42:08,996 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 295 flow [2025-01-10 00:42:08,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=295, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2025-01-10 00:42:08,997 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 15 predicate places. [2025-01-10 00:42:08,997 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 295 flow [2025-01-10 00:42:08,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:08,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:08,997 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:08,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:42:08,997 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:08,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash 736359084, now seen corresponding path program 1 times [2025-01-10 00:42:08,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:08,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978579285] [2025-01-10 00:42:08,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:08,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:09,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:42:09,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:42:09,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:09,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:09,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:09,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978579285] [2025-01-10 00:42:09,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978579285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:09,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:09,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:42:09,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466117693] [2025-01-10 00:42:09,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:09,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:42:09,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:09,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:42:09,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:42:09,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 00:42:09,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:09,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:09,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 00:42:09,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:11,043 INFO L124 PetriNetUnfolderBase]: 10968/17666 cut-off events. [2025-01-10 00:42:11,043 INFO L125 PetriNetUnfolderBase]: For 40301/40301 co-relation queries the response was YES. [2025-01-10 00:42:11,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57662 conditions, 17666 events. 10968/17666 cut-off events. For 40301/40301 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 138164 event pairs, 2038 based on Foata normal form. 342/17829 useless extension candidates. Maximal degree in co-relation 57640. Up to 5706 conditions per place. [2025-01-10 00:42:11,182 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 60 selfloop transitions, 12 changer transitions 68/155 dead transitions. [2025-01-10 00:42:11,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 155 transitions, 1150 flow [2025-01-10 00:42:11,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:42:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:42:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 320 transitions. [2025-01-10 00:42:11,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2025-01-10 00:42:11,188 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 295 flow. Second operand 10 states and 320 transitions. [2025-01-10 00:42:11,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 155 transitions, 1150 flow [2025-01-10 00:42:11,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 155 transitions, 1078 flow, removed 36 selfloop flow, removed 5 redundant places. [2025-01-10 00:42:11,420 INFO L231 Difference]: Finished difference. Result has 84 places, 64 transitions, 412 flow [2025-01-10 00:42:11,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=412, PETRI_PLACES=84, PETRI_TRANSITIONS=64} [2025-01-10 00:42:11,421 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places. [2025-01-10 00:42:11,421 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 412 flow [2025-01-10 00:42:11,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:11,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:11,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:11,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:42:11,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:11,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:11,422 INFO L85 PathProgramCache]: Analyzing trace with hash 663365011, now seen corresponding path program 1 times [2025-01-10 00:42:11,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:11,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424127691] [2025-01-10 00:42:11,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:11,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:11,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 00:42:11,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 00:42:11,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:11,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:11,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:11,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424127691] [2025-01-10 00:42:11,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424127691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:11,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:11,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:42:11,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372476661] [2025-01-10 00:42:11,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:11,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:42:11,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:11,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:42:11,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:42:11,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-01-10 00:42:11,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 412 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:11,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:11,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-01-10 00:42:11,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:14,777 INFO L124 PetriNetUnfolderBase]: 19638/30083 cut-off events. [2025-01-10 00:42:14,778 INFO L125 PetriNetUnfolderBase]: For 57661/64208 co-relation queries the response was YES. [2025-01-10 00:42:15,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84350 conditions, 30083 events. 19638/30083 cut-off events. For 57661/64208 co-relation queries the response was YES. Maximal size of possible extension queue 1404. Compared 229293 event pairs, 2922 based on Foata normal form. 1874/30768 useless extension candidates. Maximal degree in co-relation 84322. Up to 15831 conditions per place. [2025-01-10 00:42:15,261 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 58 selfloop transitions, 6 changer transitions 0/98 dead transitions. [2025-01-10 00:42:15,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 98 transitions, 704 flow [2025-01-10 00:42:15,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:42:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:42:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-01-10 00:42:15,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2025-01-10 00:42:15,263 INFO L175 Difference]: Start difference. First operand has 84 places, 64 transitions, 412 flow. Second operand 4 states and 148 transitions. [2025-01-10 00:42:15,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 98 transitions, 704 flow [2025-01-10 00:42:15,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 98 transitions, 682 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-01-10 00:42:15,465 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 440 flow [2025-01-10 00:42:15,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=440, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2025-01-10 00:42:15,466 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2025-01-10 00:42:15,466 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 440 flow [2025-01-10 00:42:15,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:15,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:15,466 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] [2025-01-10 00:42:15,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:42:15,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:15,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:15,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1528578155, now seen corresponding path program 1 times [2025-01-10 00:42:15,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:15,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475946025] [2025-01-10 00:42:15,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:15,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:42:15,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:42:15,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:15,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:15,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475946025] [2025-01-10 00:42:15,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475946025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:15,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:15,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:42:15,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155255752] [2025-01-10 00:42:15,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:15,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:42:15,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:15,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:42:15,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:42:15,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 00:42:15,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 440 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:15,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:15,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 00:42:15,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:19,682 INFO L124 PetriNetUnfolderBase]: 27390/43505 cut-off events. [2025-01-10 00:42:19,682 INFO L125 PetriNetUnfolderBase]: For 91142/92495 co-relation queries the response was YES. [2025-01-10 00:42:20,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142157 conditions, 43505 events. 27390/43505 cut-off events. For 91142/92495 co-relation queries the response was YES. Maximal size of possible extension queue 2047. Compared 370718 event pairs, 8814 based on Foata normal form. 642/40554 useless extension candidates. Maximal degree in co-relation 142129. Up to 15793 conditions per place. [2025-01-10 00:42:20,138 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 109 selfloop transitions, 35 changer transitions 8/172 dead transitions. [2025-01-10 00:42:20,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 172 transitions, 1301 flow [2025-01-10 00:42:20,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:42:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:42:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 329 transitions. [2025-01-10 00:42:20,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5981818181818181 [2025-01-10 00:42:20,140 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 440 flow. Second operand 10 states and 329 transitions. [2025-01-10 00:42:20,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 172 transitions, 1301 flow [2025-01-10 00:42:20,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 172 transitions, 1279 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-01-10 00:42:20,342 INFO L231 Difference]: Finished difference. Result has 92 places, 91 transitions, 817 flow [2025-01-10 00:42:20,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=817, PETRI_PLACES=92, PETRI_TRANSITIONS=91} [2025-01-10 00:42:20,343 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 30 predicate places. [2025-01-10 00:42:20,343 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 91 transitions, 817 flow [2025-01-10 00:42:20,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:20,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:20,343 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] [2025-01-10 00:42:20,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:42:20,344 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:20,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:20,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1246863095, now seen corresponding path program 1 times [2025-01-10 00:42:20,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:20,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359570284] [2025-01-10 00:42:20,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:20,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:20,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:42:20,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:42:20,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:20,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:20,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:20,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359570284] [2025-01-10 00:42:20,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359570284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:20,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:20,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:42:20,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948238622] [2025-01-10 00:42:20,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:20,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:42:20,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:20,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:42:20,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:42:20,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-01-10 00:42:20,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 91 transitions, 817 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:20,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:20,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-01-10 00:42:20,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:24,858 INFO L124 PetriNetUnfolderBase]: 28052/42920 cut-off events. [2025-01-10 00:42:24,859 INFO L125 PetriNetUnfolderBase]: For 89279/99217 co-relation queries the response was YES. [2025-01-10 00:42:25,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135568 conditions, 42920 events. 28052/42920 cut-off events. For 89279/99217 co-relation queries the response was YES. Maximal size of possible extension queue 1950. Compared 337029 event pairs, 2597 based on Foata normal form. 2820/44531 useless extension candidates. Maximal degree in co-relation 135534. Up to 17217 conditions per place. [2025-01-10 00:42:25,228 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 85 selfloop transitions, 10 changer transitions 11/150 dead transitions. [2025-01-10 00:42:25,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 150 transitions, 1410 flow [2025-01-10 00:42:25,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:42:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:42:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2025-01-10 00:42:25,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6872727272727273 [2025-01-10 00:42:25,229 INFO L175 Difference]: Start difference. First operand has 92 places, 91 transitions, 817 flow. Second operand 5 states and 189 transitions. [2025-01-10 00:42:25,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 150 transitions, 1410 flow [2025-01-10 00:42:25,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 150 transitions, 1390 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-01-10 00:42:25,634 INFO L231 Difference]: Finished difference. Result has 98 places, 87 transitions, 757 flow [2025-01-10 00:42:25,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=757, PETRI_PLACES=98, PETRI_TRANSITIONS=87} [2025-01-10 00:42:25,635 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 36 predicate places. [2025-01-10 00:42:25,635 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 87 transitions, 757 flow [2025-01-10 00:42:25,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:25,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:25,636 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:25,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:42:25,636 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:25,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:25,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1931955776, now seen corresponding path program 1 times [2025-01-10 00:42:25,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:25,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249144605] [2025-01-10 00:42:25,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:25,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:25,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 00:42:25,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 00:42:25,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:25,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:25,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249144605] [2025-01-10 00:42:25,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249144605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:25,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:25,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:42:25,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038265413] [2025-01-10 00:42:25,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:25,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:42:25,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:25,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:42:25,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:42:25,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2025-01-10 00:42:25,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 87 transitions, 757 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:25,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:25,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2025-01-10 00:42:25,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:30,288 INFO L124 PetriNetUnfolderBase]: 23515/41150 cut-off events. [2025-01-10 00:42:30,289 INFO L125 PetriNetUnfolderBase]: For 105052/111920 co-relation queries the response was YES. [2025-01-10 00:42:30,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138638 conditions, 41150 events. 23515/41150 cut-off events. For 105052/111920 co-relation queries the response was YES. Maximal size of possible extension queue 2510. Compared 398177 event pairs, 11429 based on Foata normal form. 1036/38294 useless extension candidates. Maximal degree in co-relation 138600. Up to 14323 conditions per place. [2025-01-10 00:42:30,772 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 54 selfloop transitions, 10 changer transitions 18/127 dead transitions. [2025-01-10 00:42:30,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 127 transitions, 1166 flow [2025-01-10 00:42:30,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:42:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:42:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2025-01-10 00:42:30,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6436363636363637 [2025-01-10 00:42:30,774 INFO L175 Difference]: Start difference. First operand has 98 places, 87 transitions, 757 flow. Second operand 5 states and 177 transitions. [2025-01-10 00:42:30,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 127 transitions, 1166 flow [2025-01-10 00:42:31,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 127 transitions, 1139 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-01-10 00:42:31,155 INFO L231 Difference]: Finished difference. Result has 97 places, 89 transitions, 797 flow [2025-01-10 00:42:31,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=797, PETRI_PLACES=97, PETRI_TRANSITIONS=89} [2025-01-10 00:42:31,155 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 35 predicate places. [2025-01-10 00:42:31,156 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 89 transitions, 797 flow [2025-01-10 00:42:31,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:31,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:31,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:31,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:42:31,156 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:31,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:31,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1751135024, now seen corresponding path program 2 times [2025-01-10 00:42:31,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:31,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298314084] [2025-01-10 00:42:31,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:42:31,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:31,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-01-10 00:42:31,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 00:42:31,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:42:31,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:31,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:31,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298314084] [2025-01-10 00:42:31,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298314084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:31,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:42:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941853521] [2025-01-10 00:42:31,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:31,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:42:31,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:31,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:42:31,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:42:31,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-01-10 00:42:31,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 89 transitions, 797 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:31,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:31,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-01-10 00:42:31,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand