./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-sre-subst.wvr.c --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/weaver/chl-sre-subst.wvr.c -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 3f15efb4f8a286b7a1ad39e3d0e5f0f11fbc70672e37c5d5b49fafb43ac86a5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:03:44,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:03:44,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:03:44,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:03:44,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:03:44,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:03:44,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:03:44,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:03:44,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:03:44,364 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:03:44,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:03:44,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:03:44,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:03:44,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:03:44,365 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:03:44,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:03:44,365 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:03:44,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:03:44,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:03:44,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:03:44,365 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:03:44,365 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:03:44,366 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:03:44,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:03:44,366 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:03:44,366 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:03:44,366 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:03:44,366 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:03:44,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:03:44,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:03:44,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:03:44,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:03:44,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:03:44,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:03:44,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:03:44,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:03:44,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:03:44,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:03:44,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:03:44,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:03:44,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:03:44,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:03:44,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:03:44,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:03:44,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:03:44,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:03:44,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:03:44,368 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 -> 3f15efb4f8a286b7a1ad39e3d0e5f0f11fbc70672e37c5d5b49fafb43ac86a5c [2025-01-10 01:03:44,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:03:44,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:03:44,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:03:44,609 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:03:44,609 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:03:44,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-sre-subst.wvr.c [2025-01-10 01:03:45,734 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/623b131a6/667b8544eb8844359bfed9f254db557b/FLAG6d01f8420 [2025-01-10 01:03:45,971 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:03:45,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-sre-subst.wvr.c [2025-01-10 01:03:46,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/623b131a6/667b8544eb8844359bfed9f254db557b/FLAG6d01f8420 [2025-01-10 01:03:46,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/623b131a6/667b8544eb8844359bfed9f254db557b [2025-01-10 01:03:46,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:03:46,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:03:46,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:03:46,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:03:46,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:03:46,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bacfa17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46, skipping insertion in model container [2025-01-10 01:03:46,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:03:46,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:03:46,485 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:03:46,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:03:46,509 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:03:46,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46 WrapperNode [2025-01-10 01:03:46,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:03:46,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:03:46,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:03:46,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:03:46,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,529 INFO L138 Inliner]: procedures = 21, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 63 [2025-01-10 01:03:46,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:03:46,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:03:46,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:03:46,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:03:46,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,543 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 01:03:46,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,546 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:03:46,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:03:46,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:03:46,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:03:46,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46" (1/1) ... [2025-01-10 01:03:46,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:03:46,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:46,575 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 01:03:46,577 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 01:03:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:03:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:03:46,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:03:46,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:03:46,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:03:46,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:03:46,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:03:46,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:03:46,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:03:46,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:03:46,594 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 01:03:46,647 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:03:46,649 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:03:46,748 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:03:46,748 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:03:46,833 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:03:46,833 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:03:46,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:03:46 BoogieIcfgContainer [2025-01-10 01:03:46,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:03:46,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:03:46,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:03:46,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:03:46,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:03:46" (1/3) ... [2025-01-10 01:03:46,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2400a5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:03:46, skipping insertion in model container [2025-01-10 01:03:46,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:46" (2/3) ... [2025-01-10 01:03:46,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2400a5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:03:46, skipping insertion in model container [2025-01-10 01:03:46,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:03:46" (3/3) ... [2025-01-10 01:03:46,840 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-sre-subst.wvr.c [2025-01-10 01:03:46,850 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:03:46,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-sre-subst.wvr.c that has 4 procedures, 22 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-10 01:03:46,851 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:03:46,881 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:03:46,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 63 flow [2025-01-10 01:03:46,934 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-01-10 01:03:46,939 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:03:46,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 18 events. 0/18 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 8 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-01-10 01:03:46,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 21 transitions, 63 flow [2025-01-10 01:03:46,944 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 17 transitions, 52 flow [2025-01-10 01:03:46,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:03:46,964 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;@68997365, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:03:46,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-10 01:03:46,977 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:03:46,979 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-01-10 01:03:46,979 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:03:46,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:46,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:46,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:03:46,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash 141444741, now seen corresponding path program 1 times [2025-01-10 01:03:46,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:46,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9467022] [2025-01-10 01:03:46,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:46,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:47,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:03:47,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:03:47,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:47,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:48,779 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 01:03:48,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:48,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9467022] [2025-01-10 01:03:48,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9467022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:48,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:48,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:03:48,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240653931] [2025-01-10 01:03:48,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:48,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:03:48,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:48,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:03:48,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:03:48,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-01-10 01:03:48,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 17 transitions, 52 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 01:03:48,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:48,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-01-10 01:03:48,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:49,239 INFO L124 PetriNetUnfolderBase]: 32/85 cut-off events. [2025-01-10 01:03:49,240 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-10 01:03:49,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 85 events. 32/85 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 220 event pairs, 1 based on Foata normal form. 3/88 useless extension candidates. Maximal degree in co-relation 145. Up to 33 conditions per place. [2025-01-10 01:03:49,246 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 26 selfloop transitions, 6 changer transitions 5/38 dead transitions. [2025-01-10 01:03:49,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 198 flow [2025-01-10 01:03:49,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:03:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:03:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2025-01-10 01:03:49,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-01-10 01:03:49,268 INFO L175 Difference]: Start difference. First operand has 27 places, 17 transitions, 52 flow. Second operand 7 states and 75 transitions. [2025-01-10 01:03:49,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 198 flow [2025-01-10 01:03:49,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:03:49,281 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 69 flow [2025-01-10 01:03:49,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=69, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2025-01-10 01:03:49,290 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2025-01-10 01:03:49,293 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 69 flow [2025-01-10 01:03:49,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 01:03:49,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:49,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:49,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:03:49,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:03:49,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:49,299 INFO L85 PathProgramCache]: Analyzing trace with hash -387739085, now seen corresponding path program 2 times [2025-01-10 01:03:49,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:49,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681958716] [2025-01-10 01:03:49,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:49,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:49,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:03:49,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:03:49,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:03:49,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:50,164 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 01:03:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:50,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681958716] [2025-01-10 01:03:50,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681958716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:50,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:50,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:03:50,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854040248] [2025-01-10 01:03:50,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:50,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:50,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:50,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:50,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:50,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-01-10 01:03:50,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 69 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:50,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:50,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-01-10 01:03:50,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:50,394 INFO L124 PetriNetUnfolderBase]: 31/97 cut-off events. [2025-01-10 01:03:50,394 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-10 01:03:50,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 97 events. 31/97 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 321 event pairs, 3 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 256. Up to 46 conditions per place. [2025-01-10 01:03:50,395 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 26 selfloop transitions, 7 changer transitions 7/41 dead transitions. [2025-01-10 01:03:50,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 213 flow [2025-01-10 01:03:50,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:03:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:03:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2025-01-10 01:03:50,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-01-10 01:03:50,398 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 69 flow. Second operand 6 states and 70 transitions. [2025-01-10 01:03:50,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 213 flow [2025-01-10 01:03:50,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 208 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:50,400 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 97 flow [2025-01-10 01:03:50,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=97, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2025-01-10 01:03:50,402 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2025-01-10 01:03:50,402 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 97 flow [2025-01-10 01:03:50,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:50,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:50,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:50,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:03:50,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:03:50,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:50,404 INFO L85 PathProgramCache]: Analyzing trace with hash 491691235, now seen corresponding path program 3 times [2025-01-10 01:03:50,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:50,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17392472] [2025-01-10 01:03:50,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:03:50,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:50,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:03:50,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:03:50,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:03:50,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:51,432 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 01:03:51,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:51,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17392472] [2025-01-10 01:03:51,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17392472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:51,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:51,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:03:51,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338112894] [2025-01-10 01:03:51,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:51,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:03:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:51,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:03:51,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:03:51,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-01-10 01:03:51,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 01:03:51,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:51,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-01-10 01:03:51,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:51,692 INFO L124 PetriNetUnfolderBase]: 28/87 cut-off events. [2025-01-10 01:03:51,692 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-01-10 01:03:51,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 87 events. 28/87 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 265 event pairs, 1 based on Foata normal form. 1/88 useless extension candidates. Maximal degree in co-relation 284. Up to 42 conditions per place. [2025-01-10 01:03:51,693 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 23 selfloop transitions, 6 changer transitions 9/39 dead transitions. [2025-01-10 01:03:51,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 234 flow [2025-01-10 01:03:51,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:03:51,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:03:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2025-01-10 01:03:51,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4965986394557823 [2025-01-10 01:03:51,696 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 97 flow. Second operand 7 states and 73 transitions. [2025-01-10 01:03:51,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 234 flow [2025-01-10 01:03:51,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 220 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:51,698 INFO L231 Difference]: Finished difference. Result has 38 places, 19 transitions, 97 flow [2025-01-10 01:03:51,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=97, PETRI_PLACES=38, PETRI_TRANSITIONS=19} [2025-01-10 01:03:51,699 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2025-01-10 01:03:51,699 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 19 transitions, 97 flow [2025-01-10 01:03:51,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 01:03:51,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:51,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:51,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:03:51,700 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:03:51,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash 467567569, now seen corresponding path program 4 times [2025-01-10 01:03:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:51,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141247366] [2025-01-10 01:03:51,700 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:03:51,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:51,706 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:03:51,712 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:03:51,712 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:03:51,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:52,141 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 01:03:52,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:52,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141247366] [2025-01-10 01:03:52,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141247366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:52,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:52,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:03:52,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58236608] [2025-01-10 01:03:52,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:52,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:52,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:52,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:52,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:52,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-01-10 01:03:52,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 19 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:52,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:52,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-01-10 01:03:52,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:52,429 INFO L124 PetriNetUnfolderBase]: 15/51 cut-off events. [2025-01-10 01:03:52,429 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-01-10 01:03:52,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 51 events. 15/51 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 116 event pairs, 0 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 179. Up to 16 conditions per place. [2025-01-10 01:03:52,430 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 16 selfloop transitions, 5 changer transitions 10/32 dead transitions. [2025-01-10 01:03:52,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 200 flow [2025-01-10 01:03:52,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:03:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:03:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2025-01-10 01:03:52,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2025-01-10 01:03:52,431 INFO L175 Difference]: Start difference. First operand has 38 places, 19 transitions, 97 flow. Second operand 6 states and 61 transitions. [2025-01-10 01:03:52,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 200 flow [2025-01-10 01:03:52,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 178 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-01-10 01:03:52,433 INFO L231 Difference]: Finished difference. Result has 35 places, 17 transitions, 75 flow [2025-01-10 01:03:52,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=75, PETRI_PLACES=35, PETRI_TRANSITIONS=17} [2025-01-10 01:03:52,433 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2025-01-10 01:03:52,433 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 17 transitions, 75 flow [2025-01-10 01:03:52,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:52,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:52,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:52,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:03:52,434 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:03:52,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:52,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1984227379, now seen corresponding path program 5 times [2025-01-10 01:03:52,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:52,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855829733] [2025-01-10 01:03:52,434 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:03:52,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:52,440 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:03:52,457 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:03:52,457 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:03:52,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:52,911 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 01:03:52,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:52,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855829733] [2025-01-10 01:03:52,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855829733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:52,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:52,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:03:52,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460728154] [2025-01-10 01:03:52,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:52,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:52,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:52,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:52,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:52,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-01-10 01:03:52,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 17 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:52,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:52,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-01-10 01:03:52,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:53,164 INFO L124 PetriNetUnfolderBase]: 8/37 cut-off events. [2025-01-10 01:03:53,164 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 01:03:53,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 37 events. 8/37 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 125. Up to 17 conditions per place. [2025-01-10 01:03:53,165 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 13 selfloop transitions, 3 changer transitions 10/27 dead transitions. [2025-01-10 01:03:53,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 159 flow [2025-01-10 01:03:53,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:03:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:03:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2025-01-10 01:03:53,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-01-10 01:03:53,168 INFO L175 Difference]: Start difference. First operand has 35 places, 17 transitions, 75 flow. Second operand 6 states and 57 transitions. [2025-01-10 01:03:53,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 159 flow [2025-01-10 01:03:53,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 129 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-01-10 01:03:53,169 INFO L231 Difference]: Finished difference. Result has 32 places, 15 transitions, 53 flow [2025-01-10 01:03:53,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=53, PETRI_PLACES=32, PETRI_TRANSITIONS=15} [2025-01-10 01:03:53,170 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2025-01-10 01:03:53,170 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 15 transitions, 53 flow [2025-01-10 01:03:53,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:53,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:53,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:53,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:03:53,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:03:53,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:53,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1455433263, now seen corresponding path program 6 times [2025-01-10 01:03:53,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:53,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898287907] [2025-01-10 01:03:53,171 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:03:53,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:53,177 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:03:53,189 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:03:53,189 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 01:03:53,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:53,865 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 01:03:53,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:53,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898287907] [2025-01-10 01:03:53,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898287907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:53,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:53,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:03:53,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988877314] [2025-01-10 01:03:53,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:53,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:53,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:53,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:53,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:53,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-01-10 01:03:53,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 15 transitions, 53 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:53,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:53,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-01-10 01:03:53,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:54,049 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2025-01-10 01:03:54,049 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:03:54,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 19 events. 3/19 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 58. Up to 7 conditions per place. [2025-01-10 01:03:54,050 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 0 selfloop transitions, 0 changer transitions 16/16 dead transitions. [2025-01-10 01:03:54,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 16 transitions, 85 flow [2025-01-10 01:03:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:03:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:03:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2025-01-10 01:03:54,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.373015873015873 [2025-01-10 01:03:54,051 INFO L175 Difference]: Start difference. First operand has 32 places, 15 transitions, 53 flow. Second operand 6 states and 47 transitions. [2025-01-10 01:03:54,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 16 transitions, 85 flow [2025-01-10 01:03:54,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 16 transitions, 74 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 01:03:54,052 INFO L231 Difference]: Finished difference. Result has 27 places, 0 transitions, 0 flow [2025-01-10 01:03:54,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=27, PETRI_TRANSITIONS=0} [2025-01-10 01:03:54,053 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-01-10 01:03:54,053 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 0 transitions, 0 flow [2025-01-10 01:03:54,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:54,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-01-10 01:03:54,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-01-10 01:03:54,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-10 01:03:54,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-01-10 01:03:54,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-01-10 01:03:54,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:03:54,058 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-01-10 01:03:54,060 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 01:03:54,060 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:03:54,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:03:54 BasicIcfg [2025-01-10 01:03:54,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:03:54,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:03:54,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:03:54,065 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:03:54,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:03:46" (3/4) ... [2025-01-10 01:03:54,067 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:03:54,069 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-10 01:03:54,069 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-10 01:03:54,069 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-10 01:03:54,073 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2025-01-10 01:03:54,073 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-10 01:03:54,073 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 01:03:54,073 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 01:03:54,131 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:03:54,131 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:03:54,131 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:03:54,133 INFO L158 Benchmark]: Toolchain (without parser) took 7823.37ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 106.6MB in the beginning and 348.7MB in the end (delta: -242.0MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2025-01-10 01:03:54,133 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:03:54,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.86ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.1MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:03:54,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.79ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 94.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:03:54,134 INFO L158 Benchmark]: Boogie Preprocessor took 19.63ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.7MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:03:54,135 INFO L158 Benchmark]: RCFGBuilder took 283.40ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 67.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 01:03:54,135 INFO L158 Benchmark]: TraceAbstraction took 7229.45ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 67.6MB in the beginning and 356.9MB in the end (delta: -289.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2025-01-10 01:03:54,135 INFO L158 Benchmark]: Witness Printer took 66.37ms. Allocated memory is still 444.6MB. Free memory was 356.9MB in the beginning and 348.7MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:03:54,137 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 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.86ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.1MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.79ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 94.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.63ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.7MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 283.40ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 67.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7229.45ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 67.6MB in the beginning and 356.9MB in the end (delta: -289.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Witness Printer took 66.37ms. Allocated memory is still 444.6MB. Free memory was 356.9MB in the beginning and 348.7MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 59]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 31 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 177 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 373 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 373 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=2, InterpolantAutomatonStates: 38, 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.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 2516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 01:03:54,155 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