./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-atomic/lamport.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-atomic/lamport.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 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:38:37,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:38:37,632 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:38:37,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:38:37,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:38:37,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:38:37,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:38:37,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:38:37,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:38:37,663 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:38:37,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:38:37,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:38:37,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:38:37,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:38:37,664 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:38:37,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:38:37,665 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:38:37,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:38:37,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:38:37,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:38:37,665 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:38:37,665 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:38:37,665 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:38:37,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:38:37,665 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:38:37,665 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:38:37,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:38:37,666 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:38:37,666 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:38:37,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:38:37,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:37,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:37,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:37,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:37,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:38:37,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:37,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:37,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:37,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:37,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:38:37,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:38:37,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:38:37,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:38:37,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:38:37,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:38:37,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:38:37,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:38:37,668 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 -> 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c [2025-01-10 00:38:37,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:38:37,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:38:37,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:38:37,880 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:38:37,880 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:38:37,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/lamport.i [2025-01-10 00:38:39,039 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ecb9c156/bc970098aaa8401a8ec1d3019729904f/FLAG600ab289a [2025-01-10 00:38:39,356 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:38:39,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i [2025-01-10 00:38:39,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ecb9c156/bc970098aaa8401a8ec1d3019729904f/FLAG600ab289a [2025-01-10 00:38:39,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ecb9c156/bc970098aaa8401a8ec1d3019729904f [2025-01-10 00:38:39,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:38:39,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:38:39,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:39,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:38:39,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:38:39,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:39" (1/1) ... [2025-01-10 00:38:39,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13bef3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:39, skipping insertion in model container [2025-01-10 00:38:39,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:39" (1/1) ... [2025-01-10 00:38:39,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:38:39,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:39,884 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:38:39,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:39,936 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:38:39,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:39 WrapperNode [2025-01-10 00:38:39,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:39,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:39,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:38:39,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:38:39,941 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:38:39" (1/1) ... [2025-01-10 00:38:39,948 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:38:39" (1/1) ... [2025-01-10 00:38:39,958 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 99 [2025-01-10 00:38:39,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:39,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:38:39,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:38:39,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:38:39,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:39" (1/1) ... [2025-01-10 00:38:39,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:39" (1/1) ... [2025-01-10 00:38:39,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:39" (1/1) ... [2025-01-10 00:38:39,971 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:38:39,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:39" (1/1) ... [2025-01-10 00:38:39,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:39" (1/1) ... [2025-01-10 00:38:39,973 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:39" (1/1) ... [2025-01-10 00:38:39,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:39" (1/1) ... [2025-01-10 00:38:39,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:39" (1/1) ... [2025-01-10 00:38:39,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:39" (1/1) ... [2025-01-10 00:38:39,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:39" (1/1) ... [2025-01-10 00:38:39,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:38:39,979 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:38:39,979 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:38:39,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:38:39,980 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:39" (1/1) ... [2025-01-10 00:38:39,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:39,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:40,008 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:38:40,018 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:38:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-01-10 00:38:40,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-01-10 00:38:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 00:38:40,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 00:38:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:38:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:38:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:38:40,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:38:40,034 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:38:40,111 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:38:40,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:38:40,322 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:38:40,323 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:38:40,375 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:38:40,375 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 00:38:40,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:40 BoogieIcfgContainer [2025-01-10 00:38:40,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:38:40,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:38:40,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:38:40,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:38:40,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:38:39" (1/3) ... [2025-01-10 00:38:40,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a0bda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:40, skipping insertion in model container [2025-01-10 00:38:40,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:39" (2/3) ... [2025-01-10 00:38:40,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a0bda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:40, skipping insertion in model container [2025-01-10 00:38:40,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:40" (3/3) ... [2025-01-10 00:38:40,384 INFO L128 eAbstractionObserver]: Analyzing ICFG lamport.i [2025-01-10 00:38:40,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:38:40,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lamport.i that has 3 procedures, 57 locations, 1 initial locations, 8 loop locations, and 3 error locations. [2025-01-10 00:38:40,398 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:38:40,448 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:38:40,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 74 transitions, 162 flow [2025-01-10 00:38:40,513 INFO L124 PetriNetUnfolderBase]: 18/72 cut-off events. [2025-01-10 00:38:40,518 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:38:40,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 18/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 193 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 67. Up to 3 conditions per place. [2025-01-10 00:38:40,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 74 transitions, 162 flow [2025-01-10 00:38:40,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 71 transitions, 154 flow [2025-01-10 00:38:40,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:38:40,542 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;@22d9823c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:38:40,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:38:40,547 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:38:40,547 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2025-01-10 00:38:40,548 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:40,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:40,548 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:40,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:40,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:40,552 INFO L85 PathProgramCache]: Analyzing trace with hash -963444681, now seen corresponding path program 1 times [2025-01-10 00:38:40,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:40,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843727376] [2025-01-10 00:38:40,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:40,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:40,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:38:40,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:38:40,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:40,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:40,658 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:38:40,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:40,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843727376] [2025-01-10 00:38:40,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843727376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:40,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:40,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:40,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309988518] [2025-01-10 00:38:40,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:40,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:38:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:40,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:38:40,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:38:40,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 74 [2025-01-10 00:38:40,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 71 transitions, 154 flow. Second operand has 2 states, 2 states have (on average 58.0) internal successors, (116), 2 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:38:40,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:40,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 74 [2025-01-10 00:38:40,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:40,752 INFO L124 PetriNetUnfolderBase]: 46/153 cut-off events. [2025-01-10 00:38:40,753 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 00:38:40,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 153 events. 46/153 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 607 event pairs, 22 based on Foata normal form. 40/154 useless extension candidates. Maximal degree in co-relation 192. Up to 52 conditions per place. [2025-01-10 00:38:40,755 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 11 selfloop transitions, 0 changer transitions 0/63 dead transitions. [2025-01-10 00:38:40,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 160 flow [2025-01-10 00:38:40,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:38:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:38:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 129 transitions. [2025-01-10 00:38:40,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8716216216216216 [2025-01-10 00:38:40,766 INFO L175 Difference]: Start difference. First operand has 60 places, 71 transitions, 154 flow. Second operand 2 states and 129 transitions. [2025-01-10 00:38:40,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 160 flow [2025-01-10 00:38:40,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:38:40,774 INFO L231 Difference]: Finished difference. Result has 55 places, 63 transitions, 130 flow [2025-01-10 00:38:40,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=130, PETRI_PLACES=55, PETRI_TRANSITIONS=63} [2025-01-10 00:38:40,779 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2025-01-10 00:38:40,779 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 63 transitions, 130 flow [2025-01-10 00:38:40,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 58.0) internal successors, (116), 2 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:38:40,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:40,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:40,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:38:40,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:40,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:40,782 INFO L85 PathProgramCache]: Analyzing trace with hash 762825853, now seen corresponding path program 1 times [2025-01-10 00:38:40,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:40,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830412468] [2025-01-10 00:38:40,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:40,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:40,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:38:40,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:38:40,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:40,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:40,885 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:38:40,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:40,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830412468] [2025-01-10 00:38:40,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830412468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:40,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:40,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:40,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678547130] [2025-01-10 00:38:40,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:40,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:40,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:40,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:40,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:40,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 74 [2025-01-10 00:38:40,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 63 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:38:40,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:40,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 74 [2025-01-10 00:38:40,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:40,966 INFO L124 PetriNetUnfolderBase]: 82/269 cut-off events. [2025-01-10 00:38:40,966 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 00:38:40,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 269 events. 82/269 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1285 event pairs, 20 based on Foata normal form. 12/232 useless extension candidates. Maximal degree in co-relation 403. Up to 72 conditions per place. [2025-01-10 00:38:40,968 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 18 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2025-01-10 00:38:40,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 188 flow [2025-01-10 00:38:40,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2025-01-10 00:38:40,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8198198198198198 [2025-01-10 00:38:40,974 INFO L175 Difference]: Start difference. First operand has 55 places, 63 transitions, 130 flow. Second operand 3 states and 182 transitions. [2025-01-10 00:38:40,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 188 flow [2025-01-10 00:38:40,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:40,977 INFO L231 Difference]: Finished difference. Result has 59 places, 64 transitions, 150 flow [2025-01-10 00:38:40,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=59, PETRI_TRANSITIONS=64} [2025-01-10 00:38:40,977 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2025-01-10 00:38:40,977 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 64 transitions, 150 flow [2025-01-10 00:38:40,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:38:40,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:40,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:40,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:38:40,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:40,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:40,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1207809030, now seen corresponding path program 1 times [2025-01-10 00:38:40,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:40,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469575354] [2025-01-10 00:38:40,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:40,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:40,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:38:41,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:38:41,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:41,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:41,078 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:38:41,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:41,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469575354] [2025-01-10 00:38:41,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469575354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:41,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:41,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:41,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197093167] [2025-01-10 00:38:41,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:41,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:41,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:41,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:41,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:41,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 74 [2025-01-10 00:38:41,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 64 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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:38:41,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:41,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 74 [2025-01-10 00:38:41,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:41,173 INFO L124 PetriNetUnfolderBase]: 72/260 cut-off events. [2025-01-10 00:38:41,174 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-10 00:38:41,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 260 events. 72/260 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1240 event pairs, 30 based on Foata normal form. 15/243 useless extension candidates. Maximal degree in co-relation 442. Up to 81 conditions per place. [2025-01-10 00:38:41,176 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 18 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2025-01-10 00:38:41,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 202 flow [2025-01-10 00:38:41,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2025-01-10 00:38:41,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8153153153153153 [2025-01-10 00:38:41,181 INFO L175 Difference]: Start difference. First operand has 59 places, 64 transitions, 150 flow. Second operand 3 states and 181 transitions. [2025-01-10 00:38:41,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 202 flow [2025-01-10 00:38:41,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:41,182 INFO L231 Difference]: Finished difference. Result has 60 places, 64 transitions, 154 flow [2025-01-10 00:38:41,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=60, PETRI_TRANSITIONS=64} [2025-01-10 00:38:41,183 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2025-01-10 00:38:41,183 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 64 transitions, 154 flow [2025-01-10 00:38:41,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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:38:41,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:41,183 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:38:41,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:38:41,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:41,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:41,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1982157874, now seen corresponding path program 1 times [2025-01-10 00:38:41,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:41,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302947086] [2025-01-10 00:38:41,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:41,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:41,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:38:41,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:38:41,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:41,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:41,263 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:38:41,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:41,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302947086] [2025-01-10 00:38:41,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302947086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:41,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:41,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:41,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029692669] [2025-01-10 00:38:41,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:41,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:41,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:41,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:41,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:41,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2025-01-10 00:38:41,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 64 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:38:41,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:41,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2025-01-10 00:38:41,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:41,354 INFO L124 PetriNetUnfolderBase]: 350/840 cut-off events. [2025-01-10 00:38:41,354 INFO L125 PetriNetUnfolderBase]: For 105/109 co-relation queries the response was YES. [2025-01-10 00:38:41,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 840 events. 350/840 cut-off events. For 105/109 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5124 event pairs, 126 based on Foata normal form. 14/767 useless extension candidates. Maximal degree in co-relation 1467. Up to 392 conditions per place. [2025-01-10 00:38:41,358 INFO L140 encePairwiseOnDemand]: 64/74 looper letters, 29 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2025-01-10 00:38:41,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 247 flow [2025-01-10 00:38:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2025-01-10 00:38:41,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7567567567567568 [2025-01-10 00:38:41,360 INFO L175 Difference]: Start difference. First operand has 60 places, 64 transitions, 154 flow. Second operand 3 states and 168 transitions. [2025-01-10 00:38:41,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 247 flow [2025-01-10 00:38:41,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:38:41,362 INFO L231 Difference]: Finished difference. Result has 63 places, 68 transitions, 198 flow [2025-01-10 00:38:41,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2025-01-10 00:38:41,363 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2025-01-10 00:38:41,363 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 198 flow [2025-01-10 00:38:41,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:38:41,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:41,363 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:38:41,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:38:41,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:41,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:41,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1840582900, now seen corresponding path program 2 times [2025-01-10 00:38:41,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:41,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990873588] [2025-01-10 00:38:41,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:41,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:41,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:38:41,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:38:41,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:38:41,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:41,409 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:38:41,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:41,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990873588] [2025-01-10 00:38:41,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990873588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:41,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:41,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:41,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037601846] [2025-01-10 00:38:41,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:41,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:41,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:41,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:41,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:41,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 74 [2025-01-10 00:38:41,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 68 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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:38:41,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:41,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 74 [2025-01-10 00:38:41,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:41,515 INFO L124 PetriNetUnfolderBase]: 394/1146 cut-off events. [2025-01-10 00:38:41,516 INFO L125 PetriNetUnfolderBase]: For 164/177 co-relation queries the response was YES. [2025-01-10 00:38:41,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2105 conditions, 1146 events. 394/1146 cut-off events. For 164/177 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8391 event pairs, 102 based on Foata normal form. 27/1001 useless extension candidates. Maximal degree in co-relation 2098. Up to 232 conditions per place. [2025-01-10 00:38:41,520 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 23 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2025-01-10 00:38:41,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 276 flow [2025-01-10 00:38:41,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2025-01-10 00:38:41,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8153153153153153 [2025-01-10 00:38:41,522 INFO L175 Difference]: Start difference. First operand has 63 places, 68 transitions, 198 flow. Second operand 3 states and 181 transitions. [2025-01-10 00:38:41,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 276 flow [2025-01-10 00:38:41,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:41,527 INFO L231 Difference]: Finished difference. Result has 65 places, 71 transitions, 216 flow [2025-01-10 00:38:41,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=65, PETRI_TRANSITIONS=71} [2025-01-10 00:38:41,528 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2025-01-10 00:38:41,529 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 71 transitions, 216 flow [2025-01-10 00:38:41,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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:38:41,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:41,529 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:38:41,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:38:41,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:41,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:41,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1947762986, now seen corresponding path program 3 times [2025-01-10 00:38:41,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:41,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338083822] [2025-01-10 00:38:41,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:38:41,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:41,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:38:41,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:38:41,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:38:41,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:41,577 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:38:41,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:41,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338083822] [2025-01-10 00:38:41,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338083822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:41,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:41,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:41,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92197094] [2025-01-10 00:38:41,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:41,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:41,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:41,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:41,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:41,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2025-01-10 00:38:41,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 71 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:38:41,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:41,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2025-01-10 00:38:41,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:41,717 INFO L124 PetriNetUnfolderBase]: 566/1497 cut-off events. [2025-01-10 00:38:41,717 INFO L125 PetriNetUnfolderBase]: For 436/506 co-relation queries the response was YES. [2025-01-10 00:38:41,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3106 conditions, 1497 events. 566/1497 cut-off events. For 436/506 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11099 event pairs, 228 based on Foata normal form. 77/1467 useless extension candidates. Maximal degree in co-relation 3098. Up to 672 conditions per place. [2025-01-10 00:38:41,724 INFO L140 encePairwiseOnDemand]: 64/74 looper letters, 31 selfloop transitions, 6 changer transitions 0/80 dead transitions. [2025-01-10 00:38:41,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 321 flow [2025-01-10 00:38:41,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-01-10 00:38:41,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7522522522522522 [2025-01-10 00:38:41,725 INFO L175 Difference]: Start difference. First operand has 65 places, 71 transitions, 216 flow. Second operand 3 states and 167 transitions. [2025-01-10 00:38:41,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 321 flow [2025-01-10 00:38:41,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 80 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:41,727 INFO L231 Difference]: Finished difference. Result has 67 places, 75 transitions, 268 flow [2025-01-10 00:38:41,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=67, PETRI_TRANSITIONS=75} [2025-01-10 00:38:41,728 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2025-01-10 00:38:41,728 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 75 transitions, 268 flow [2025-01-10 00:38:41,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:38:41,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:41,728 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:38:41,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:38:41,729 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:41,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:41,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1274415120, now seen corresponding path program 4 times [2025-01-10 00:38:41,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:41,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869944095] [2025-01-10 00:38:41,729 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:38:41,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:41,737 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-10 00:38:41,738 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 23 statements. [2025-01-10 00:38:41,738 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 00:38:41,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:41,771 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:38:41,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:41,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869944095] [2025-01-10 00:38:41,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869944095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:41,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:41,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:41,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589423583] [2025-01-10 00:38:41,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:41,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:41,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:41,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:41,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:41,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 74 [2025-01-10 00:38:41,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 75 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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:38:41,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:41,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 74 [2025-01-10 00:38:41,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:41,855 INFO L124 PetriNetUnfolderBase]: 288/988 cut-off events. [2025-01-10 00:38:41,855 INFO L125 PetriNetUnfolderBase]: For 379/429 co-relation queries the response was YES. [2025-01-10 00:38:41,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 988 events. 288/988 cut-off events. For 379/429 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7421 event pairs, 88 based on Foata normal form. 37/920 useless extension candidates. Maximal degree in co-relation 2044. Up to 182 conditions per place. [2025-01-10 00:38:41,859 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 21 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2025-01-10 00:38:41,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 81 transitions, 332 flow [2025-01-10 00:38:41,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2025-01-10 00:38:41,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8153153153153153 [2025-01-10 00:38:41,860 INFO L175 Difference]: Start difference. First operand has 67 places, 75 transitions, 268 flow. Second operand 3 states and 181 transitions. [2025-01-10 00:38:41,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 81 transitions, 332 flow [2025-01-10 00:38:41,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 81 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:41,863 INFO L231 Difference]: Finished difference. Result has 67 places, 74 transitions, 258 flow [2025-01-10 00:38:41,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=67, PETRI_TRANSITIONS=74} [2025-01-10 00:38:41,863 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2025-01-10 00:38:41,864 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 74 transitions, 258 flow [2025-01-10 00:38:41,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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:38:41,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:41,864 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:38:41,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:38:41,864 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:41,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:41,865 INFO L85 PathProgramCache]: Analyzing trace with hash -606230499, now seen corresponding path program 1 times [2025-01-10 00:38:41,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:41,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616857822] [2025-01-10 00:38:41,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:41,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:41,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:38:41,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:38:41,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:41,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:41,902 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:38:41,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:41,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616857822] [2025-01-10 00:38:41,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616857822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:41,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:41,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:41,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584882351] [2025-01-10 00:38:41,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:41,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:41,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:41,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:41,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:41,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 74 [2025-01-10 00:38:41,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 74 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:38:41,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:41,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 74 [2025-01-10 00:38:41,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:41,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L757-->thr1EXIT: Formula: (and (= 0 |v_thr1Thread1of1ForFork1_#res#1.offset_1|) (= |v_thr1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_1|, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_#res#1.base][44], [Black: 79#(= ~y~0 1), Black: 84#(= 2 ~x~0), 16#L783true, 3#L790true, Black: 68#true, 7#thr1EXITtrue, 66#true, Black: 89#(= 2 ~y~0), Black: 75#(= ~X~0 1), 95#true, 94#(<= ~x~0 1)]) [2025-01-10 00:38:41,969 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-10 00:38:41,969 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:38:41,969 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:38:41,969 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 00:38:41,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L757-->thr1EXIT: Formula: (and (= 0 |v_thr1Thread1of1ForFork1_#res#1.offset_1|) (= |v_thr1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_1|, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_#res#1.base][44], [Black: 79#(= ~y~0 1), Black: 84#(= 2 ~x~0), 3#L790true, Black: 68#true, 7#thr1EXITtrue, 66#true, Black: 89#(= 2 ~y~0), 36#thr2EXITtrue, Black: 75#(= ~X~0 1), 95#true, 94#(<= ~x~0 1)]) [2025-01-10 00:38:41,970 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2025-01-10 00:38:41,970 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:38:41,970 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:38:41,970 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 00:38:41,970 INFO L124 PetriNetUnfolderBase]: 326/998 cut-off events. [2025-01-10 00:38:41,970 INFO L125 PetriNetUnfolderBase]: For 135/165 co-relation queries the response was YES. [2025-01-10 00:38:41,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1975 conditions, 998 events. 326/998 cut-off events. For 135/165 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7145 event pairs, 130 based on Foata normal form. 33/925 useless extension candidates. Maximal degree in co-relation 1966. Up to 354 conditions per place. [2025-01-10 00:38:41,974 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 16 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2025-01-10 00:38:41,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 307 flow [2025-01-10 00:38:41,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-01-10 00:38:41,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837837837837838 [2025-01-10 00:38:41,975 INFO L175 Difference]: Start difference. First operand has 67 places, 74 transitions, 258 flow. Second operand 3 states and 174 transitions. [2025-01-10 00:38:41,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 307 flow [2025-01-10 00:38:41,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:38:41,977 INFO L231 Difference]: Finished difference. Result has 69 places, 75 transitions, 273 flow [2025-01-10 00:38:41,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=69, PETRI_TRANSITIONS=75} [2025-01-10 00:38:41,977 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2025-01-10 00:38:41,977 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 273 flow [2025-01-10 00:38:41,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:38:41,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:41,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:41,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:38:41,978 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:41,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:41,978 INFO L85 PathProgramCache]: Analyzing trace with hash -632742766, now seen corresponding path program 1 times [2025-01-10 00:38:41,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:41,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518475770] [2025-01-10 00:38:41,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:41,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:41,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:38:41,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:38:41,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:41,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:42,008 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:38:42,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:42,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518475770] [2025-01-10 00:38:42,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518475770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:42,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:42,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:42,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686643720] [2025-01-10 00:38:42,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:42,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:42,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:42,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:42,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:42,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 74 [2025-01-10 00:38:42,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 273 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:38:42,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:42,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 74 [2025-01-10 00:38:42,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:42,159 INFO L124 PetriNetUnfolderBase]: 353/1158 cut-off events. [2025-01-10 00:38:42,163 INFO L125 PetriNetUnfolderBase]: For 155/178 co-relation queries the response was YES. [2025-01-10 00:38:42,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2382 conditions, 1158 events. 353/1158 cut-off events. For 155/178 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8191 event pairs, 102 based on Foata normal form. 21/1126 useless extension candidates. Maximal degree in co-relation 2372. Up to 322 conditions per place. [2025-01-10 00:38:42,169 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 15 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2025-01-10 00:38:42,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 294 flow [2025-01-10 00:38:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2025-01-10 00:38:42,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7792792792792793 [2025-01-10 00:38:42,175 INFO L175 Difference]: Start difference. First operand has 69 places, 75 transitions, 273 flow. Second operand 3 states and 173 transitions. [2025-01-10 00:38:42,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 294 flow [2025-01-10 00:38:42,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 284 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:42,182 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 253 flow [2025-01-10 00:38:42,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2025-01-10 00:38:42,183 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2025-01-10 00:38:42,183 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 253 flow [2025-01-10 00:38:42,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:38:42,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:42,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:42,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:38:42,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:42,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:42,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2110658093, now seen corresponding path program 1 times [2025-01-10 00:38:42,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:42,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545305621] [2025-01-10 00:38:42,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:42,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:42,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 00:38:42,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 00:38:42,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:42,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:42,237 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:38:42,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:42,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545305621] [2025-01-10 00:38:42,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545305621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:42,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:42,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:38:42,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820473554] [2025-01-10 00:38:42,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:42,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:42,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:42,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:42,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:42,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 74 [2025-01-10 00:38:42,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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:38:42,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:42,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 74 [2025-01-10 00:38:42,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:42,317 INFO L124 PetriNetUnfolderBase]: 137/528 cut-off events. [2025-01-10 00:38:42,317 INFO L125 PetriNetUnfolderBase]: For 53/60 co-relation queries the response was YES. [2025-01-10 00:38:42,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 528 events. 137/528 cut-off events. For 53/60 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3208 event pairs, 52 based on Foata normal form. 4/485 useless extension candidates. Maximal degree in co-relation 1050. Up to 124 conditions per place. [2025-01-10 00:38:42,323 INFO L140 encePairwiseOnDemand]: 72/74 looper letters, 0 selfloop transitions, 0 changer transitions 67/67 dead transitions. [2025-01-10 00:38:42,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 269 flow [2025-01-10 00:38:42,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-01-10 00:38:42,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7882882882882883 [2025-01-10 00:38:42,324 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 253 flow. Second operand 3 states and 175 transitions. [2025-01-10 00:38:42,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 269 flow [2025-01-10 00:38:42,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 67 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:42,325 INFO L231 Difference]: Finished difference. Result has 63 places, 0 transitions, 0 flow [2025-01-10 00:38:42,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=63, PETRI_TRANSITIONS=0} [2025-01-10 00:38:42,326 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2025-01-10 00:38:42,326 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 0 transitions, 0 flow [2025-01-10 00:38:42,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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:38:42,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-01-10 00:38:42,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 00:38:42,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-01-10 00:38:42,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-10 00:38:42,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-01-10 00:38:42,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-01-10 00:38:42,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:38:42,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:38:42,333 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:42,337 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:38:42,340 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:38:42,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:38:42 BasicIcfg [2025-01-10 00:38:42,348 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:38:42,349 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:38:42,349 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:38:42,349 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:38:42,349 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:40" (3/4) ... [2025-01-10 00:38:42,350 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 00:38:42,357 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2025-01-10 00:38:42,357 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2025-01-10 00:38:42,359 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2025-01-10 00:38:42,362 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 00:38:42,363 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 00:38:42,363 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 00:38:42,459 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:38:42,459 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:38:42,460 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:38:42,460 INFO L158 Benchmark]: Toolchain (without parser) took 2837.00ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 119.9MB in the end (delta: 6.2MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2025-01-10 00:38:42,460 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 226.5MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:38:42,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.08ms. Allocated memory is still 167.8MB. Free memory was 125.7MB in the beginning and 106.3MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:38:42,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.07ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 104.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:38:42,461 INFO L158 Benchmark]: Boogie Preprocessor took 20.31ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 102.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:38:42,461 INFO L158 Benchmark]: RCFGBuilder took 396.16ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 85.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:38:42,461 INFO L158 Benchmark]: TraceAbstraction took 1971.33ms. Allocated memory is still 167.8MB. Free memory was 85.3MB in the beginning and 124.8MB in the end (delta: -39.6MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2025-01-10 00:38:42,461 INFO L158 Benchmark]: Witness Printer took 110.74ms. Allocated memory is still 167.8MB. Free memory was 124.8MB in the beginning and 119.9MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:38:42,462 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.17ms. Allocated memory is still 226.5MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.08ms. Allocated memory is still 167.8MB. Free memory was 125.7MB in the beginning and 106.3MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.07ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 104.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.31ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 102.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 396.16ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 85.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1971.33ms. Allocated memory is still 167.8MB. Free memory was 85.3MB in the beginning and 124.8MB in the end (delta: -39.6MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * Witness Printer took 110.74ms. Allocated memory is still 167.8MB. Free memory was 124.8MB in the beginning and 119.9MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 786]: 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 5 procedures, 105 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 59 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred in iteration=8, InterpolantAutomatonStates: 29, 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, 0.4s InterpolantComputationTime, 213 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 351 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 00:38:42,486 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