./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe017_tso.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/safe017_tso.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 f42e8f5213d7b87505465b65029831bd75698bf771428502e6718d43723a660f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:50:42,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:50:42,276 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:50:42,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:50:42,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:50:42,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:50:42,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:50:42,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:50:42,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:50:42,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:50:42,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:50:42,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:50:42,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:50:42,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:50:42,316 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:50:42,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:50:42,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:50:42,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:50:42,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:50:42,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:50:42,317 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:50:42,317 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:50:42,317 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:50:42,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:50:42,317 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:50:42,317 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:50:42,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:50:42,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:50:42,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:50:42,318 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:50:42,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:50:42,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:50:42,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:50:42,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:50:42,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:50:42,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:50:42,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:50:42,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:50:42,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:50:42,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:50:42,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:50:42,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:50:42,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:50:42,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:50:42,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:50:42,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:50:42,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:50:42,320 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 -> f42e8f5213d7b87505465b65029831bd75698bf771428502e6718d43723a660f [2025-01-10 00:50:42,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:50:42,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:50:42,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:50:42,623 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:50:42,624 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:50:42,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe017_tso.i [2025-01-10 00:50:43,979 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c77d9eab4/608635d3f43646be8d0972c3038ba13f/FLAGac5dd46ff [2025-01-10 00:50:44,361 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:50:44,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_tso.i [2025-01-10 00:50:44,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c77d9eab4/608635d3f43646be8d0972c3038ba13f/FLAGac5dd46ff [2025-01-10 00:50:44,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c77d9eab4/608635d3f43646be8d0972c3038ba13f [2025-01-10 00:50:44,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:50:44,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:50:44,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:50:44,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:50:44,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:50:44,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:50:44" (1/1) ... [2025-01-10 00:50:44,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cad595b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:44, skipping insertion in model container [2025-01-10 00:50:44,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:50:44" (1/1) ... [2025-01-10 00:50:44,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:50:44,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:50:44,933 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:50:44,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:50:45,010 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:50:45,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:45 WrapperNode [2025-01-10 00:50:45,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:50:45,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:50:45,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:50:45,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:50:45,016 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:50:45" (1/1) ... [2025-01-10 00:50:45,025 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:50:45" (1/1) ... [2025-01-10 00:50:45,038 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 58 [2025-01-10 00:50:45,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:50:45,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:50:45,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:50:45,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:50:45,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:45" (1/1) ... [2025-01-10 00:50:45,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:45" (1/1) ... [2025-01-10 00:50:45,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:45" (1/1) ... [2025-01-10 00:50:45,057 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:50:45,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:45" (1/1) ... [2025-01-10 00:50:45,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:45" (1/1) ... [2025-01-10 00:50:45,063 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:45" (1/1) ... [2025-01-10 00:50:45,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:45" (1/1) ... [2025-01-10 00:50:45,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:45" (1/1) ... [2025-01-10 00:50:45,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:45" (1/1) ... [2025-01-10 00:50:45,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:45" (1/1) ... [2025-01-10 00:50:45,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:50:45,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:50:45,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:50:45,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:50:45,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:45" (1/1) ... [2025-01-10 00:50:45,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:50:45,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:50:45,105 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:50:45,111 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:50:45,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:50:45,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:50:45,128 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:50:45,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:50:45,129 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:50:45,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:50:45,129 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:50:45,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:50:45,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:50:45,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:50:45,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:50:45,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:50:45,130 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:50:45,254 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:50:45,256 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:50:45,410 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:50:45,411 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:50:45,496 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:50:45,497 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:50:45,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:50:45 BoogieIcfgContainer [2025-01-10 00:50:45,497 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:50:45,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:50:45,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:50:45,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:50:45,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:50:44" (1/3) ... [2025-01-10 00:50:45,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75063472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:50:45, skipping insertion in model container [2025-01-10 00:50:45,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:45" (2/3) ... [2025-01-10 00:50:45,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75063472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:50:45, skipping insertion in model container [2025-01-10 00:50:45,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:50:45" (3/3) ... [2025-01-10 00:50:45,506 INFO L128 eAbstractionObserver]: Analyzing ICFG safe017_tso.i [2025-01-10 00:50:45,522 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:50:45,524 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe017_tso.i that has 4 procedures, 41 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-10 00:50:45,524 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:50:45,574 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:50:45,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 96 flow [2025-01-10 00:50:45,640 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2025-01-10 00:50:45,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:50:45,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 2/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-01-10 00:50:45,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 42 transitions, 96 flow [2025-01-10 00:50:45,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 38 transitions, 85 flow [2025-01-10 00:50:45,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:50:45,675 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;@166fad7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:50:45,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-10 00:50:45,689 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:50:45,689 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2025-01-10 00:50:45,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:50:45,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:45,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:45,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:50:45,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:45,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1606252642, now seen corresponding path program 1 times [2025-01-10 00:50:45,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:45,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950130503] [2025-01-10 00:50:45,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:45,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:45,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:50:45,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:50:45,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:45,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:45,971 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:50:45,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:45,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950130503] [2025-01-10 00:50:45,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950130503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:45,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:45,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:50:45,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950797441] [2025-01-10 00:50:45,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:45,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:50:45,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:46,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:50:46,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:50:46,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 42 [2025-01-10 00:50:46,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:46,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:46,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 42 [2025-01-10 00:50:46,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:46,158 INFO L124 PetriNetUnfolderBase]: 75/217 cut-off events. [2025-01-10 00:50:46,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:50:46,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 217 events. 75/217 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1177 event pairs, 75 based on Foata normal form. 24/222 useless extension candidates. Maximal degree in co-relation 361. Up to 136 conditions per place. [2025-01-10 00:50:46,165 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 12 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2025-01-10 00:50:46,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 105 flow [2025-01-10 00:50:46,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:50:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:50:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-01-10 00:50:46,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2025-01-10 00:50:46,178 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 85 flow. Second operand 3 states and 86 transitions. [2025-01-10 00:50:46,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 105 flow [2025-01-10 00:50:46,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:50:46,185 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2025-01-10 00:50:46,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-01-10 00:50:46,192 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2025-01-10 00:50:46,194 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2025-01-10 00:50:46,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:46,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:46,194 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:46,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:50:46,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:50:46,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:46,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1606254071, now seen corresponding path program 1 times [2025-01-10 00:50:46,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:46,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231439094] [2025-01-10 00:50:46,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:46,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:50:46,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:50:46,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:46,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:46,559 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:50:46,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:46,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231439094] [2025-01-10 00:50:46,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231439094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:46,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:46,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:50:46,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492174694] [2025-01-10 00:50:46,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:46,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:50:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:46,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:50:46,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:50:46,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2025-01-10 00:50:46,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:46,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:46,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2025-01-10 00:50:46,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:47,145 INFO L124 PetriNetUnfolderBase]: 1466/2724 cut-off events. [2025-01-10 00:50:47,146 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:50:47,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5033 conditions, 2724 events. 1466/2724 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 19371 event pairs, 337 based on Foata normal form. 0/2601 useless extension candidates. Maximal degree in co-relation 5027. Up to 751 conditions per place. [2025-01-10 00:50:47,169 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 29 selfloop transitions, 6 changer transitions 55/103 dead transitions. [2025-01-10 00:50:47,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 103 transitions, 398 flow [2025-01-10 00:50:47,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:50:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:50:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 245 transitions. [2025-01-10 00:50:47,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2025-01-10 00:50:47,173 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 9 states and 245 transitions. [2025-01-10 00:50:47,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 103 transitions, 398 flow [2025-01-10 00:50:47,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 103 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:50:47,177 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 155 flow [2025-01-10 00:50:47,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=155, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2025-01-10 00:50:47,179 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2025-01-10 00:50:47,179 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 155 flow [2025-01-10 00:50:47,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:47,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:47,179 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:50:47,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:50:47,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:50:47,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:47,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1891444842, now seen corresponding path program 1 times [2025-01-10 00:50:47,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:47,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674849523] [2025-01-10 00:50:47,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:47,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:47,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:50:47,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:50:47,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:47,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:47,449 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:50:47,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:47,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674849523] [2025-01-10 00:50:47,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674849523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:47,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:47,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:50:47,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236637923] [2025-01-10 00:50:47,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:47,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:50:47,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:47,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:50:47,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:50:47,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2025-01-10 00:50:47,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 37 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 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:50:47,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:47,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2025-01-10 00:50:47,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:47,854 INFO L124 PetriNetUnfolderBase]: 991/1957 cut-off events. [2025-01-10 00:50:47,854 INFO L125 PetriNetUnfolderBase]: For 2970/2970 co-relation queries the response was YES. [2025-01-10 00:50:47,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5723 conditions, 1957 events. 991/1957 cut-off events. For 2970/2970 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13607 event pairs, 168 based on Foata normal form. 66/2000 useless extension candidates. Maximal degree in co-relation 5708. Up to 541 conditions per place. [2025-01-10 00:50:47,870 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 33 selfloop transitions, 7 changer transitions 48/101 dead transitions. [2025-01-10 00:50:47,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 101 transitions, 677 flow [2025-01-10 00:50:47,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:50:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:50:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2025-01-10 00:50:47,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6047619047619047 [2025-01-10 00:50:47,873 INFO L175 Difference]: Start difference. First operand has 57 places, 37 transitions, 155 flow. Second operand 10 states and 254 transitions. [2025-01-10 00:50:47,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 101 transitions, 677 flow [2025-01-10 00:50:47,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 101 transitions, 589 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-01-10 00:50:47,908 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 205 flow [2025-01-10 00:50:47,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=205, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2025-01-10 00:50:47,909 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2025-01-10 00:50:47,909 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 205 flow [2025-01-10 00:50:47,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 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:50:47,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:47,910 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:50:47,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:50:47,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:50:47,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:47,911 INFO L85 PathProgramCache]: Analyzing trace with hash -403918282, now seen corresponding path program 1 times [2025-01-10 00:50:47,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:47,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534487746] [2025-01-10 00:50:47,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:47,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:47,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:50:47,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:50:47,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:47,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:48,090 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:50:48,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:48,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534487746] [2025-01-10 00:50:48,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534487746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:48,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:48,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:50:48,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549627549] [2025-01-10 00:50:48,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:48,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:50:48,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:48,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:50:48,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:50:48,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2025-01-10 00:50:48,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 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:50:48,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:48,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2025-01-10 00:50:48,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:48,468 INFO L124 PetriNetUnfolderBase]: 900/1839 cut-off events. [2025-01-10 00:50:48,468 INFO L125 PetriNetUnfolderBase]: For 5267/5270 co-relation queries the response was YES. [2025-01-10 00:50:48,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5927 conditions, 1839 events. 900/1839 cut-off events. For 5267/5270 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12788 event pairs, 168 based on Foata normal form. 61/1885 useless extension candidates. Maximal degree in co-relation 5905. Up to 559 conditions per place. [2025-01-10 00:50:48,483 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 40 selfloop transitions, 11 changer transitions 40/104 dead transitions. [2025-01-10 00:50:48,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 104 transitions, 751 flow [2025-01-10 00:50:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:50:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:50:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 259 transitions. [2025-01-10 00:50:48,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-01-10 00:50:48,485 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 205 flow. Second operand 10 states and 259 transitions. [2025-01-10 00:50:48,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 104 transitions, 751 flow [2025-01-10 00:50:48,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 704 flow, removed 21 selfloop flow, removed 3 redundant places. [2025-01-10 00:50:48,495 INFO L231 Difference]: Finished difference. Result has 72 places, 44 transitions, 281 flow [2025-01-10 00:50:48,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=281, PETRI_PLACES=72, PETRI_TRANSITIONS=44} [2025-01-10 00:50:48,496 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2025-01-10 00:50:48,496 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 44 transitions, 281 flow [2025-01-10 00:50:48,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 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:50:48,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:48,497 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:50:48,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:50:48,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:50:48,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:48,498 INFO L85 PathProgramCache]: Analyzing trace with hash -649017959, now seen corresponding path program 1 times [2025-01-10 00:50:48,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:48,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423912314] [2025-01-10 00:50:48,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:48,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:48,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:50:48,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:50:48,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:48,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:48,635 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:50:48,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:48,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423912314] [2025-01-10 00:50:48,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423912314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:48,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:48,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:50:48,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131216865] [2025-01-10 00:50:48,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:48,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:50:48,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:48,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:50:48,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:50:48,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-01-10 00:50:48,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 44 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:48,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:48,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-01-10 00:50:48,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:48,881 INFO L124 PetriNetUnfolderBase]: 641/1447 cut-off events. [2025-01-10 00:50:48,882 INFO L125 PetriNetUnfolderBase]: For 4930/5043 co-relation queries the response was YES. [2025-01-10 00:50:48,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4621 conditions, 1447 events. 641/1447 cut-off events. For 4930/5043 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10275 event pairs, 237 based on Foata normal form. 103/1463 useless extension candidates. Maximal degree in co-relation 4592. Up to 767 conditions per place. [2025-01-10 00:50:48,898 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 26 selfloop transitions, 7 changer transitions 25/81 dead transitions. [2025-01-10 00:50:48,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 81 transitions, 650 flow [2025-01-10 00:50:48,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:50:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:50:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2025-01-10 00:50:48,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2025-01-10 00:50:48,904 INFO L175 Difference]: Start difference. First operand has 72 places, 44 transitions, 281 flow. Second operand 7 states and 186 transitions. [2025-01-10 00:50:48,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 81 transitions, 650 flow [2025-01-10 00:50:48,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 81 transitions, 602 flow, removed 24 selfloop flow, removed 10 redundant places. [2025-01-10 00:50:48,915 INFO L231 Difference]: Finished difference. Result has 67 places, 49 transitions, 353 flow [2025-01-10 00:50:48,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=353, PETRI_PLACES=67, PETRI_TRANSITIONS=49} [2025-01-10 00:50:48,916 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2025-01-10 00:50:48,916 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 49 transitions, 353 flow [2025-01-10 00:50:48,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:48,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:48,916 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:50:48,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:50:48,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:50:48,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:48,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1470662293, now seen corresponding path program 1 times [2025-01-10 00:50:48,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:48,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489879374] [2025-01-10 00:50:48,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:48,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:48,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:50:48,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:50:48,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:48,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:49,069 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:50:49,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:49,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489879374] [2025-01-10 00:50:49,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489879374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:49,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:49,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:50:49,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078367516] [2025-01-10 00:50:49,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:49,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:50:49,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:49,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:50:49,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:50:49,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2025-01-10 00:50:49,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 49 transitions, 353 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:49,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:49,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2025-01-10 00:50:49,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:49,454 INFO L124 PetriNetUnfolderBase]: 812/1720 cut-off events. [2025-01-10 00:50:49,455 INFO L125 PetriNetUnfolderBase]: For 5305/5305 co-relation queries the response was YES. [2025-01-10 00:50:49,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5795 conditions, 1720 events. 812/1720 cut-off events. For 5305/5305 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12324 event pairs, 123 based on Foata normal form. 38/1731 useless extension candidates. Maximal degree in co-relation 5769. Up to 513 conditions per place. [2025-01-10 00:50:49,469 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 42 selfloop transitions, 16 changer transitions 31/102 dead transitions. [2025-01-10 00:50:49,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 102 transitions, 808 flow [2025-01-10 00:50:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:50:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:50:49,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2025-01-10 00:50:49,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5928571428571429 [2025-01-10 00:50:49,472 INFO L175 Difference]: Start difference. First operand has 67 places, 49 transitions, 353 flow. Second operand 10 states and 249 transitions. [2025-01-10 00:50:49,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 102 transitions, 808 flow [2025-01-10 00:50:49,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 102 transitions, 767 flow, removed 17 selfloop flow, removed 3 redundant places. [2025-01-10 00:50:49,484 INFO L231 Difference]: Finished difference. Result has 77 places, 49 transitions, 408 flow [2025-01-10 00:50:49,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=408, PETRI_PLACES=77, PETRI_TRANSITIONS=49} [2025-01-10 00:50:49,485 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 31 predicate places. [2025-01-10 00:50:49,486 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 49 transitions, 408 flow [2025-01-10 00:50:49,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:50:49,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:49,487 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:50:49,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:50:49,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:50:49,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:49,488 INFO L85 PathProgramCache]: Analyzing trace with hash -911593554, now seen corresponding path program 1 times [2025-01-10 00:50:49,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:49,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193206159] [2025-01-10 00:50:49,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:49,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:49,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:50:49,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:50:49,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:49,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:49,634 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:50:49,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:49,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193206159] [2025-01-10 00:50:49,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193206159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:49,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:49,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:50:49,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160515288] [2025-01-10 00:50:49,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:49,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:50:49,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:49,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:50:49,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:50:49,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-01-10 00:50:49,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 49 transitions, 408 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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:50:49,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:49,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-01-10 00:50:49,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:49,910 INFO L124 PetriNetUnfolderBase]: 794/1830 cut-off events. [2025-01-10 00:50:49,910 INFO L125 PetriNetUnfolderBase]: For 9972/10047 co-relation queries the response was YES. [2025-01-10 00:50:49,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6409 conditions, 1830 events. 794/1830 cut-off events. For 9972/10047 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14330 event pairs, 211 based on Foata normal form. 101/1848 useless extension candidates. Maximal degree in co-relation 6376. Up to 579 conditions per place. [2025-01-10 00:50:49,925 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 28 selfloop transitions, 6 changer transitions 23/77 dead transitions. [2025-01-10 00:50:49,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 77 transitions, 730 flow [2025-01-10 00:50:49,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:50:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:50:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2025-01-10 00:50:49,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-01-10 00:50:49,927 INFO L175 Difference]: Start difference. First operand has 77 places, 49 transitions, 408 flow. Second operand 6 states and 159 transitions. [2025-01-10 00:50:49,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 77 transitions, 730 flow [2025-01-10 00:50:49,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 77 transitions, 690 flow, removed 20 selfloop flow, removed 4 redundant places. [2025-01-10 00:50:49,942 INFO L231 Difference]: Finished difference. Result has 75 places, 44 transitions, 345 flow [2025-01-10 00:50:49,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=75, PETRI_TRANSITIONS=44} [2025-01-10 00:50:49,943 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2025-01-10 00:50:49,943 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 44 transitions, 345 flow [2025-01-10 00:50:49,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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:50:49,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:49,944 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] [2025-01-10 00:50:49,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:50:49,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:50:49,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash -611016136, now seen corresponding path program 1 times [2025-01-10 00:50:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:49,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607409281] [2025-01-10 00:50:49,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:49,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:50:49,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:50:49,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:49,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:50,059 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:50:50,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:50,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607409281] [2025-01-10 00:50:50,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607409281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:50,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:50,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:50:50,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666796024] [2025-01-10 00:50:50,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:50,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:50:50,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:50,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:50:50,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:50:50,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-01-10 00:50:50,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 44 transitions, 345 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:50:50,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:50,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-01-10 00:50:50,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:50,293 INFO L124 PetriNetUnfolderBase]: 1179/2290 cut-off events. [2025-01-10 00:50:50,293 INFO L125 PetriNetUnfolderBase]: For 4130/4209 co-relation queries the response was YES. [2025-01-10 00:50:50,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5822 conditions, 2290 events. 1179/2290 cut-off events. For 4130/4209 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 16047 event pairs, 308 based on Foata normal form. 111/2316 useless extension candidates. Maximal degree in co-relation 5788. Up to 1133 conditions per place. [2025-01-10 00:50:50,312 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 27 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2025-01-10 00:50:50,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 59 transitions, 443 flow [2025-01-10 00:50:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:50:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:50:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-01-10 00:50:50,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-01-10 00:50:50,313 INFO L175 Difference]: Start difference. First operand has 75 places, 44 transitions, 345 flow. Second operand 4 states and 114 transitions. [2025-01-10 00:50:50,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 59 transitions, 443 flow [2025-01-10 00:50:50,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 59 transitions, 387 flow, removed 13 selfloop flow, removed 9 redundant places. [2025-01-10 00:50:50,324 INFO L231 Difference]: Finished difference. Result has 69 places, 48 transitions, 327 flow [2025-01-10 00:50:50,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=327, PETRI_PLACES=69, PETRI_TRANSITIONS=48} [2025-01-10 00:50:50,326 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2025-01-10 00:50:50,327 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 48 transitions, 327 flow [2025-01-10 00:50:50,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:50:50,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:50,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:50,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:50:50,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:50:50,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:50,329 INFO L85 PathProgramCache]: Analyzing trace with hash -450046283, now seen corresponding path program 1 times [2025-01-10 00:50:50,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:50,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546810993] [2025-01-10 00:50:50,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:50,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:50,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:50:50,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:50:50,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:50,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:50,450 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:50:50,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:50,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546810993] [2025-01-10 00:50:50,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546810993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:50,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:50,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:50:50,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791517567] [2025-01-10 00:50:50,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:50,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:50:50,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:50,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:50:50,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:50:50,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-01-10 00:50:50,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 48 transitions, 327 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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:50:50,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:50,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-01-10 00:50:50,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:50,680 INFO L124 PetriNetUnfolderBase]: 926/1809 cut-off events. [2025-01-10 00:50:50,680 INFO L125 PetriNetUnfolderBase]: For 1693/2100 co-relation queries the response was YES. [2025-01-10 00:50:50,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4838 conditions, 1809 events. 926/1809 cut-off events. For 1693/2100 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 11554 event pairs, 99 based on Foata normal form. 115/1854 useless extension candidates. Maximal degree in co-relation 4809. Up to 732 conditions per place. [2025-01-10 00:50:50,697 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 34 selfloop transitions, 8 changer transitions 3/69 dead transitions. [2025-01-10 00:50:50,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 474 flow [2025-01-10 00:50:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:50:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:50:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2025-01-10 00:50:50,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2025-01-10 00:50:50,699 INFO L175 Difference]: Start difference. First operand has 69 places, 48 transitions, 327 flow. Second operand 5 states and 144 transitions. [2025-01-10 00:50:50,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 474 flow [2025-01-10 00:50:50,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 453 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-01-10 00:50:50,706 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 331 flow [2025-01-10 00:50:50,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=331, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2025-01-10 00:50:50,707 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2025-01-10 00:50:50,707 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 331 flow [2025-01-10 00:50:50,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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:50:50,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:50,708 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] [2025-01-10 00:50:50,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:50:50,708 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:50:50,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:50,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1662700048, now seen corresponding path program 1 times [2025-01-10 00:50:50,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:50,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504083990] [2025-01-10 00:50:50,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:50,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:50,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:50:50,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:50:50,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:50,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:50,828 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:50:50,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:50,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504083990] [2025-01-10 00:50:50,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504083990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:50,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:50,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:50:50,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091294356] [2025-01-10 00:50:50,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:50,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:50:50,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:50,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:50:50,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:50:50,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-01-10 00:50:50,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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:50:50,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:50,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-01-10 00:50:50,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:51,016 INFO L124 PetriNetUnfolderBase]: 688/1282 cut-off events. [2025-01-10 00:50:51,017 INFO L125 PetriNetUnfolderBase]: For 2134/3289 co-relation queries the response was YES. [2025-01-10 00:50:51,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4042 conditions, 1282 events. 688/1282 cut-off events. For 2134/3289 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 7527 event pairs, 33 based on Foata normal form. 102/1309 useless extension candidates. Maximal degree in co-relation 4023. Up to 508 conditions per place. [2025-01-10 00:50:51,025 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 30 selfloop transitions, 11 changer transitions 8/68 dead transitions. [2025-01-10 00:50:51,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 68 transitions, 468 flow [2025-01-10 00:50:51,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:50:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:50:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2025-01-10 00:50:51,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2025-01-10 00:50:51,027 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 331 flow. Second operand 6 states and 166 transitions. [2025-01-10 00:50:51,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 68 transitions, 468 flow [2025-01-10 00:50:51,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 68 transitions, 428 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-01-10 00:50:51,031 INFO L231 Difference]: Finished difference. Result has 72 places, 44 transitions, 275 flow [2025-01-10 00:50:51,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=72, PETRI_TRANSITIONS=44} [2025-01-10 00:50:51,032 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2025-01-10 00:50:51,032 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 44 transitions, 275 flow [2025-01-10 00:50:51,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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:50:51,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:51,033 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] [2025-01-10 00:50:51,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:50:51,033 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:50:51,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:51,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1657232256, now seen corresponding path program 1 times [2025-01-10 00:50:51,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:51,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385328954] [2025-01-10 00:50:51,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:51,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:51,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:50:51,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:50:51,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:51,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:51,199 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:50:51,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:51,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385328954] [2025-01-10 00:50:51,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385328954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:51,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:51,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:50:51,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382792861] [2025-01-10 00:50:51,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:51,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:50:51,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:51,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:50:51,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:50:51,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2025-01-10 00:50:51,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 44 transitions, 275 flow. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 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:50:51,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:51,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2025-01-10 00:50:51,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:51,401 INFO L124 PetriNetUnfolderBase]: 414/960 cut-off events. [2025-01-10 00:50:51,402 INFO L125 PetriNetUnfolderBase]: For 1908/1981 co-relation queries the response was YES. [2025-01-10 00:50:51,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3070 conditions, 960 events. 414/960 cut-off events. For 1908/1981 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6414 event pairs, 80 based on Foata normal form. 14/885 useless extension candidates. Maximal degree in co-relation 3052. Up to 282 conditions per place. [2025-01-10 00:50:51,408 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 0 selfloop transitions, 0 changer transitions 69/69 dead transitions. [2025-01-10 00:50:51,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 69 transitions, 454 flow [2025-01-10 00:50:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:50:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:50:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2025-01-10 00:50:51,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2025-01-10 00:50:51,409 INFO L175 Difference]: Start difference. First operand has 72 places, 44 transitions, 275 flow. Second operand 8 states and 186 transitions. [2025-01-10 00:50:51,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 69 transitions, 454 flow [2025-01-10 00:50:51,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 374 flow, removed 12 selfloop flow, removed 13 redundant places. [2025-01-10 00:50:51,416 INFO L231 Difference]: Finished difference. Result has 63 places, 0 transitions, 0 flow [2025-01-10 00:50:51,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=63, PETRI_TRANSITIONS=0} [2025-01-10 00:50:51,417 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2025-01-10 00:50:51,417 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 0 transitions, 0 flow [2025-01-10 00:50:51,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 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:50:51,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-01-10 00:50:51,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-01-10 00:50:51,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-10 00:50:51,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-01-10 00:50:51,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-01-10 00:50:51,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:50:51,421 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:51,424 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:50:51,424 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:50:51,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:50:51 BasicIcfg [2025-01-10 00:50:51,429 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:50:51,430 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:50:51,430 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:50:51,430 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:50:51,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:50:45" (3/4) ... [2025-01-10 00:50:51,433 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 00:50:51,436 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2025-01-10 00:50:51,436 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2025-01-10 00:50:51,436 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2025-01-10 00:50:51,441 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2025-01-10 00:50:51,441 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 00:50:51,441 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 00:50:51,441 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 00:50:51,502 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:50:51,502 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:50:51,502 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:50:51,503 INFO L158 Benchmark]: Toolchain (without parser) took 6951.85ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 111.3MB in the beginning and 135.2MB in the end (delta: -23.9MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2025-01-10 00:50:51,503 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:50:51,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.51ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 91.4MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:50:51,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.58ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 89.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:50:51,504 INFO L158 Benchmark]: Boogie Preprocessor took 31.74ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 87.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:50:51,504 INFO L158 Benchmark]: RCFGBuilder took 425.87ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 69.2MB in the end (delta: 18.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:50:51,505 INFO L158 Benchmark]: TraceAbstraction took 5930.01ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 68.7MB in the beginning and 141.1MB in the end (delta: -72.4MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-01-10 00:50:51,505 INFO L158 Benchmark]: Witness Printer took 72.69ms. Allocated memory is still 226.5MB. Free memory was 141.1MB in the beginning and 135.2MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:50:51,506 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.51ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 91.4MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.58ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 89.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.74ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 87.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 425.87ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 69.2MB in the end (delta: 18.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5930.01ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 68.7MB in the beginning and 141.1MB in the end (delta: -72.4MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Witness Printer took 72.69ms. Allocated memory is still 226.5MB. Free memory was 141.1MB in the beginning and 135.2MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 769]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 17]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 439 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1027 IncrementalHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 79 mSDtfsCounter, 1027 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=6, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 00:50:51,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE