./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-atomic/szymanski.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/szymanski.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 a3cd4be37ada319d324d40d8d6c18fff519996a186a93f33b3070275487295e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:38:44,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:38:44,305 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:44,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:38:44,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:38:44,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:38:44,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:38:44,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:38:44,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:38:44,323 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:38:44,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:38:44,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:38:44,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:38:44,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:38:44,323 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:38:44,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:38:44,323 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:38:44,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:38:44,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:38:44,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:38:44,324 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:38:44,324 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:38:44,324 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:38:44,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:38:44,324 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:38:44,324 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:38:44,324 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:38:44,324 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:38:44,324 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:38:44,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:38:44,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:44,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:44,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:44,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:44,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:38:44,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:44,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:44,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:44,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:44,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:38:44,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:38:44,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:38:44,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:38:44,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:38:44,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:38:44,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:38:44,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:38:44,326 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 -> a3cd4be37ada319d324d40d8d6c18fff519996a186a93f33b3070275487295e3 [2025-01-10 00:38:44,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:38:44,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:38:44,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:38:44,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:38:44,668 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:38:44,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/szymanski.i [2025-01-10 00:38:45,765 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9b2c719b/90975951694544c9ad08ecdc3b720711/FLAG2335f508b [2025-01-10 00:38:46,050 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:38:46,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/szymanski.i [2025-01-10 00:38:46,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9b2c719b/90975951694544c9ad08ecdc3b720711/FLAG2335f508b [2025-01-10 00:38:46,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9b2c719b/90975951694544c9ad08ecdc3b720711 [2025-01-10 00:38:46,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:38:46,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:38:46,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:46,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:38:46,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:38:46,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4922ca42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46, skipping insertion in model container [2025-01-10 00:38:46,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:38:46,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:46,338 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:38:46,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:46,402 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:38:46,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46 WrapperNode [2025-01-10 00:38:46,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:46,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:46,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:38:46,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:38:46,409 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:46" (1/1) ... [2025-01-10 00:38:46,418 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:46" (1/1) ... [2025-01-10 00:38:46,432 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2025-01-10 00:38:46,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:46,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:38:46,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:38:46,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:38:46,439 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:46" (1/1) ... [2025-01-10 00:38:46,439 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:46" (1/1) ... [2025-01-10 00:38:46,443 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:46" (1/1) ... [2025-01-10 00:38:46,453 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:46,453 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:46" (1/1) ... [2025-01-10 00:38:46,453 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:46" (1/1) ... [2025-01-10 00:38:46,456 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:46" (1/1) ... [2025-01-10 00:38:46,456 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:46" (1/1) ... [2025-01-10 00:38:46,458 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:46" (1/1) ... [2025-01-10 00:38:46,464 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:46" (1/1) ... [2025-01-10 00:38:46,464 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:46" (1/1) ... [2025-01-10 00:38:46,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:38:46,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:38:46,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:38:46,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:38:46,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:46,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:46,490 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:46,495 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:46,509 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-01-10 00:38:46,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-01-10 00:38:46,509 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 00:38:46,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 00:38:46,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:38:46,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:38:46,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:38:46,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:38:46,510 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:46,594 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:38:46,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:38:46,711 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:38:46,714 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:38:46,765 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:38:46,766 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:38:46,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:46 BoogieIcfgContainer [2025-01-10 00:38:46,767 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:38:46,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:38:46,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:38:46,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:38:46,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:38:46" (1/3) ... [2025-01-10 00:38:46,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca1e8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:46, skipping insertion in model container [2025-01-10 00:38:46,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (2/3) ... [2025-01-10 00:38:46,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca1e8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:46, skipping insertion in model container [2025-01-10 00:38:46,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:46" (3/3) ... [2025-01-10 00:38:46,775 INFO L128 eAbstractionObserver]: Analyzing ICFG szymanski.i [2025-01-10 00:38:46,787 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:38:46,789 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG szymanski.i that has 3 procedures, 47 locations, 1 initial locations, 8 loop locations, and 3 error locations. [2025-01-10 00:38:46,789 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:38:46,840 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:38:46,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 60 transitions, 134 flow [2025-01-10 00:38:46,898 INFO L124 PetriNetUnfolderBase]: 14/58 cut-off events. [2025-01-10 00:38:46,899 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:38:46,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 58 events. 14/58 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-01-10 00:38:46,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 60 transitions, 134 flow [2025-01-10 00:38:46,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 57 transitions, 126 flow [2025-01-10 00:38:46,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:38:46,919 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;@6ecadd30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:38:46,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:38:46,927 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:38:46,927 INFO L124 PetriNetUnfolderBase]: 11/40 cut-off events. [2025-01-10 00:38:46,927 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:46,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:46,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:46,928 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:46,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:46,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1935186054, now seen corresponding path program 1 times [2025-01-10 00:38:46,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:46,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516478184] [2025-01-10 00:38:46,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:46,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:47,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:38:47,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:38:47,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:47,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:47,080 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:47,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:47,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516478184] [2025-01-10 00:38:47,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516478184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:47,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:47,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:47,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971243680] [2025-01-10 00:38:47,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:47,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:47,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:47,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:47,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:47,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 60 [2025-01-10 00:38:47,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:47,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:47,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 60 [2025-01-10 00:38:47,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:47,195 INFO L124 PetriNetUnfolderBase]: 86/253 cut-off events. [2025-01-10 00:38:47,195 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 00:38:47,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 253 events. 86/253 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1155 event pairs, 20 based on Foata normal form. 56/260 useless extension candidates. Maximal degree in co-relation 342. Up to 72 conditions per place. [2025-01-10 00:38:47,201 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 18 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-01-10 00:38:47,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 176 flow [2025-01-10 00:38:47,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2025-01-10 00:38:47,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2025-01-10 00:38:47,212 INFO L175 Difference]: Start difference. First operand has 50 places, 57 transitions, 126 flow. Second operand 3 states and 152 transitions. [2025-01-10 00:38:47,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 176 flow [2025-01-10 00:38:47,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 164 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:38:47,220 INFO L231 Difference]: Finished difference. Result has 48 places, 52 transitions, 126 flow [2025-01-10 00:38:47,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=52} [2025-01-10 00:38:47,226 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2025-01-10 00:38:47,227 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 52 transitions, 126 flow [2025-01-10 00:38:47,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:47,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:47,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:47,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:38:47,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:47,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:47,229 INFO L85 PathProgramCache]: Analyzing trace with hash 274764428, now seen corresponding path program 1 times [2025-01-10 00:38:47,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:47,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491921072] [2025-01-10 00:38:47,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:47,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:47,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:38:47,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:38:47,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:47,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:47,287 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:47,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:47,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491921072] [2025-01-10 00:38:47,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491921072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:47,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:47,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:47,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361337582] [2025-01-10 00:38:47,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:47,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:47,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:47,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:47,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:47,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 60 [2025-01-10 00:38:47,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 52 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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:47,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:47,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 60 [2025-01-10 00:38:47,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:47,361 INFO L124 PetriNetUnfolderBase]: 85/258 cut-off events. [2025-01-10 00:38:47,361 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-10 00:38:47,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 258 events. 85/258 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1156 event pairs, 30 based on Foata normal form. 15/231 useless extension candidates. Maximal degree in co-relation 109. Up to 81 conditions per place. [2025-01-10 00:38:47,363 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 18 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-01-10 00:38:47,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 178 flow [2025-01-10 00:38:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2025-01-10 00:38:47,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2025-01-10 00:38:47,369 INFO L175 Difference]: Start difference. First operand has 48 places, 52 transitions, 126 flow. Second operand 3 states and 145 transitions. [2025-01-10 00:38:47,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 178 flow [2025-01-10 00:38:47,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:47,370 INFO L231 Difference]: Finished difference. Result has 49 places, 52 transitions, 130 flow [2025-01-10 00:38:47,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=49, PETRI_TRANSITIONS=52} [2025-01-10 00:38:47,371 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2025-01-10 00:38:47,371 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 52 transitions, 130 flow [2025-01-10 00:38:47,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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:47,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:47,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:47,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:38:47,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:47,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash 17080151, now seen corresponding path program 1 times [2025-01-10 00:38:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:47,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148995346] [2025-01-10 00:38:47,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:47,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:47,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:38:47,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:38:47,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:47,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:47,487 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:47,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148995346] [2025-01-10 00:38:47,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148995346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:47,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:47,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:47,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586561612] [2025-01-10 00:38:47,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:47,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:47,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:47,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:47,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-01-10 00:38:47,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:47,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:47,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-01-10 00:38:47,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:47,630 INFO L124 PetriNetUnfolderBase]: 247/532 cut-off events. [2025-01-10 00:38:47,631 INFO L125 PetriNetUnfolderBase]: For 273/278 co-relation queries the response was YES. [2025-01-10 00:38:47,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 532 events. 247/532 cut-off events. For 273/278 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2501 event pairs, 102 based on Foata normal form. 34/501 useless extension candidates. Maximal degree in co-relation 496. Up to 256 conditions per place. [2025-01-10 00:38:47,636 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 26 selfloop transitions, 6 changer transitions 2/61 dead transitions. [2025-01-10 00:38:47,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 218 flow [2025-01-10 00:38:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2025-01-10 00:38:47,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2025-01-10 00:38:47,639 INFO L175 Difference]: Start difference. First operand has 49 places, 52 transitions, 130 flow. Second operand 3 states and 136 transitions. [2025-01-10 00:38:47,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 218 flow [2025-01-10 00:38:47,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:38:47,641 INFO L231 Difference]: Finished difference. Result has 49 places, 54 transitions, 172 flow [2025-01-10 00:38:47,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=49, PETRI_TRANSITIONS=54} [2025-01-10 00:38:47,644 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2025-01-10 00:38:47,644 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 54 transitions, 172 flow [2025-01-10 00:38:47,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:47,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:47,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:47,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:38:47,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:47,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:47,645 INFO L85 PathProgramCache]: Analyzing trace with hash -751414435, now seen corresponding path program 1 times [2025-01-10 00:38:47,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:47,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818273518] [2025-01-10 00:38:47,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:47,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:47,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:38:47,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:38:47,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:47,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:47,701 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:47,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:47,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818273518] [2025-01-10 00:38:47,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818273518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:47,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:47,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:47,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802137587] [2025-01-10 00:38:47,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:47,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:47,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:47,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:47,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:47,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-01-10 00:38:47,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 54 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:47,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:47,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-01-10 00:38:47,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:47,792 INFO L124 PetriNetUnfolderBase]: 290/608 cut-off events. [2025-01-10 00:38:47,792 INFO L125 PetriNetUnfolderBase]: For 385/396 co-relation queries the response was YES. [2025-01-10 00:38:47,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 608 events. 290/608 cut-off events. For 385/396 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2858 event pairs, 85 based on Foata normal form. 20/550 useless extension candidates. Maximal degree in co-relation 595. Up to 202 conditions per place. [2025-01-10 00:38:47,796 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 28 selfloop transitions, 9 changer transitions 2/66 dead transitions. [2025-01-10 00:38:47,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 290 flow [2025-01-10 00:38:47,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2025-01-10 00:38:47,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-10 00:38:47,799 INFO L175 Difference]: Start difference. First operand has 49 places, 54 transitions, 172 flow. Second operand 3 states and 135 transitions. [2025-01-10 00:38:47,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 290 flow [2025-01-10 00:38:47,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:47,804 INFO L231 Difference]: Finished difference. Result has 51 places, 59 transitions, 230 flow [2025-01-10 00:38:47,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=51, PETRI_TRANSITIONS=59} [2025-01-10 00:38:47,806 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2025-01-10 00:38:47,806 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 59 transitions, 230 flow [2025-01-10 00:38:47,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:47,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:47,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:47,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:38:47,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:47,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:47,807 INFO L85 PathProgramCache]: Analyzing trace with hash -867874719, now seen corresponding path program 2 times [2025-01-10 00:38:47,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:47,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653311858] [2025-01-10 00:38:47,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:47,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:47,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:38:47,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:38:47,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:38:47,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:47,847 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:47,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:47,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653311858] [2025-01-10 00:38:47,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653311858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:47,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:47,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:47,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284046097] [2025-01-10 00:38:47,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:47,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:47,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:47,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:47,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:47,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 60 [2025-01-10 00:38:47,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 59 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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:47,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:47,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 60 [2025-01-10 00:38:47,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:47,925 INFO L124 PetriNetUnfolderBase]: 343/694 cut-off events. [2025-01-10 00:38:47,925 INFO L125 PetriNetUnfolderBase]: For 879/884 co-relation queries the response was YES. [2025-01-10 00:38:47,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 694 events. 343/694 cut-off events. For 879/884 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3332 event pairs, 143 based on Foata normal form. 23/624 useless extension candidates. Maximal degree in co-relation 758. Up to 426 conditions per place. [2025-01-10 00:38:47,933 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 34 selfloop transitions, 5 changer transitions 2/66 dead transitions. [2025-01-10 00:38:47,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 338 flow [2025-01-10 00:38:47,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2025-01-10 00:38:47,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7277777777777777 [2025-01-10 00:38:47,935 INFO L175 Difference]: Start difference. First operand has 51 places, 59 transitions, 230 flow. Second operand 3 states and 131 transitions. [2025-01-10 00:38:47,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 338 flow [2025-01-10 00:38:47,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:47,940 INFO L231 Difference]: Finished difference. Result has 53 places, 59 transitions, 250 flow [2025-01-10 00:38:47,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=53, PETRI_TRANSITIONS=59} [2025-01-10 00:38:47,941 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2025-01-10 00:38:47,941 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 59 transitions, 250 flow [2025-01-10 00:38:47,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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:47,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:47,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:47,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:38:47,942 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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:47,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash 18171651, now seen corresponding path program 3 times [2025-01-10 00:38:47,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:47,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837612205] [2025-01-10 00:38:47,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:38:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:47,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:38:47,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:38:47,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:38:47,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:47,996 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:48,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:48,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837612205] [2025-01-10 00:38:48,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837612205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:48,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:48,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:48,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204955810] [2025-01-10 00:38:48,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:48,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:48,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:48,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:48,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:48,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-01-10 00:38:48,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 59 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:48,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:48,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-01-10 00:38:48,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:48,073 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([272] L742-->L744: Formula: (and (< v_~flag2~0_17 2) (= v_~x~0_12 0)) InVars {~flag2~0=v_~flag2~0_17} OutVars{~x~0=v_~x~0_12, ~flag2~0=v_~flag2~0_17} AuxVars[] AssignedVars[~x~0][21], [Black: 63#(= ~x~0 1), 75#true, 30#L769true, 9#L751true, Black: 65#true, 80#true, Black: 70#true, 19#L744true, Black: 56#true, Black: 77#(= ~flag1~0 1)]) [2025-01-10 00:38:48,074 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2025-01-10 00:38:48,074 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2025-01-10 00:38:48,074 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2025-01-10 00:38:48,074 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-01-10 00:38:48,105 INFO L124 PetriNetUnfolderBase]: 403/795 cut-off events. [2025-01-10 00:38:48,106 INFO L125 PetriNetUnfolderBase]: For 512/556 co-relation queries the response was YES. [2025-01-10 00:38:48,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1854 conditions, 795 events. 403/795 cut-off events. For 512/556 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4030 event pairs, 135 based on Foata normal form. 49/785 useless extension candidates. Maximal degree in co-relation 893. Up to 321 conditions per place. [2025-01-10 00:38:48,109 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 25 selfloop transitions, 6 changer transitions 1/67 dead transitions. [2025-01-10 00:38:48,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 330 flow [2025-01-10 00:38:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2025-01-10 00:38:48,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7444444444444445 [2025-01-10 00:38:48,111 INFO L175 Difference]: Start difference. First operand has 53 places, 59 transitions, 250 flow. Second operand 3 states and 134 transitions. [2025-01-10 00:38:48,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 330 flow [2025-01-10 00:38:48,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 67 transitions, 316 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:48,114 INFO L231 Difference]: Finished difference. Result has 52 places, 61 transitions, 282 flow [2025-01-10 00:38:48,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=52, PETRI_TRANSITIONS=61} [2025-01-10 00:38:48,115 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-01-10 00:38:48,115 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 61 transitions, 282 flow [2025-01-10 00:38:48,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:48,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:48,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:48,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:38:48,115 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:48,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1128341720, now seen corresponding path program 1 times [2025-01-10 00:38:48,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:48,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988296115] [2025-01-10 00:38:48,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:48,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:48,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 00:38:48,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 00:38:48,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:48,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:48,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:48,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988296115] [2025-01-10 00:38:48,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988296115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:48,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:48,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:48,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774135791] [2025-01-10 00:38:48,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:48,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:48,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:48,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:48,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:48,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 60 [2025-01-10 00:38:48,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 61 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:48,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:48,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 60 [2025-01-10 00:38:48,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:48,230 INFO L124 PetriNetUnfolderBase]: 448/866 cut-off events. [2025-01-10 00:38:48,230 INFO L125 PetriNetUnfolderBase]: For 802/862 co-relation queries the response was YES. [2025-01-10 00:38:48,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2277 conditions, 866 events. 448/866 cut-off events. For 802/862 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4267 event pairs, 160 based on Foata normal form. 42/830 useless extension candidates. Maximal degree in co-relation 1598. Up to 477 conditions per place. [2025-01-10 00:38:48,234 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 31 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2025-01-10 00:38:48,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 382 flow [2025-01-10 00:38:48,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2025-01-10 00:38:48,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7277777777777777 [2025-01-10 00:38:48,235 INFO L175 Difference]: Start difference. First operand has 52 places, 61 transitions, 282 flow. Second operand 3 states and 131 transitions. [2025-01-10 00:38:48,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 382 flow [2025-01-10 00:38:48,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 367 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:38:48,239 INFO L231 Difference]: Finished difference. Result has 52 places, 63 transitions, 311 flow [2025-01-10 00:38:48,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=52, PETRI_TRANSITIONS=63} [2025-01-10 00:38:48,239 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-01-10 00:38:48,239 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 63 transitions, 311 flow [2025-01-10 00:38:48,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:48,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:48,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:48,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:38:48,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:48,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:48,240 INFO L85 PathProgramCache]: Analyzing trace with hash 674403450, now seen corresponding path program 2 times [2025-01-10 00:38:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:48,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619711968] [2025-01-10 00:38:48,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:48,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-01-10 00:38:48,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 00:38:48,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:38:48,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:48,275 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:48,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:48,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619711968] [2025-01-10 00:38:48,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619711968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:48,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:48,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:38:48,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355205325] [2025-01-10 00:38:48,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:48,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:48,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:48,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:48,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:48,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 60 [2025-01-10 00:38:48,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 63 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:48,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:48,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 60 [2025-01-10 00:38:48,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:48,309 INFO L124 PetriNetUnfolderBase]: 178/431 cut-off events. [2025-01-10 00:38:48,309 INFO L125 PetriNetUnfolderBase]: For 405/438 co-relation queries the response was YES. [2025-01-10 00:38:48,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 431 events. 178/431 cut-off events. For 405/438 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2087 event pairs, 56 based on Foata normal form. 6/386 useless extension candidates. Maximal degree in co-relation 677. Up to 124 conditions per place. [2025-01-10 00:38:48,311 INFO L140 encePairwiseOnDemand]: 58/60 looper letters, 0 selfloop transitions, 0 changer transitions 62/62 dead transitions. [2025-01-10 00:38:48,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 333 flow [2025-01-10 00:38:48,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2025-01-10 00:38:48,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-10 00:38:48,312 INFO L175 Difference]: Start difference. First operand has 52 places, 63 transitions, 311 flow. Second operand 3 states and 135 transitions. [2025-01-10 00:38:48,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 333 flow [2025-01-10 00:38:48,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:48,313 INFO L231 Difference]: Finished difference. Result has 51 places, 0 transitions, 0 flow [2025-01-10 00:38:48,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=51, PETRI_TRANSITIONS=0} [2025-01-10 00:38:48,314 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2025-01-10 00:38:48,314 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 0 transitions, 0 flow [2025-01-10 00:38:48,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:48,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-01-10 00:38:48,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 00:38:48,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-01-10 00:38:48,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-10 00:38:48,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-01-10 00:38:48,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-01-10 00:38:48,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:38:48,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:38:48,317 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2025-01-10 00:38:48,320 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:38:48,320 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:38:48,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:38:48 BasicIcfg [2025-01-10 00:38:48,324 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:38:48,324 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:38:48,324 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:38:48,324 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:38:48,325 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:46" (3/4) ... [2025-01-10 00:38:48,326 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 00:38:48,327 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2025-01-10 00:38:48,328 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2025-01-10 00:38:48,329 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2025-01-10 00:38:48,330 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 00:38:48,330 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 00:38:48,330 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 00:38:48,376 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:38:48,376 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:38:48,376 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:38:48,377 INFO L158 Benchmark]: Toolchain (without parser) took 2294.34ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 52.2MB in the end (delta: 80.2MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2025-01-10 00:38:48,377 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:38:48,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.33ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 112.5MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:38:48,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.96ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:38:48,377 INFO L158 Benchmark]: Boogie Preprocessor took 31.85ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:38:48,377 INFO L158 Benchmark]: RCFGBuilder took 300.91ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 93.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:38:48,378 INFO L158 Benchmark]: TraceAbstraction took 1555.72ms. Allocated memory is still 167.8MB. Free memory was 92.8MB in the beginning and 57.5MB in the end (delta: 35.3MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2025-01-10 00:38:48,378 INFO L158 Benchmark]: Witness Printer took 51.92ms. Allocated memory is still 167.8MB. Free memory was 57.5MB in the beginning and 52.2MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:38:48,379 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.21ms. Allocated memory is still 226.5MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.33ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 112.5MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.96ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.85ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 300.91ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 93.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1555.72ms. Allocated memory is still 167.8MB. Free memory was 92.8MB in the beginning and 57.5MB in the end (delta: 35.3MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * Witness Printer took 51.92ms. Allocated memory is still 167.8MB. Free memory was 57.5MB in the beginning and 52.2MB in the end (delta: 5.3MB). 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: 765]: 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, 85 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.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 317 IncrementalHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 31 mSDtfsCounter, 317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=311occurred in iteration=7, InterpolantAutomatonStates: 24, 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.3s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:48,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE