./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-mult-4.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/popl20-mult-4.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 b81cf2d80bc77dedaac253250be737ceaa09f6e691f026864fe6fd5cb48c2489 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:11:31,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:11:31,208 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:11:31,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:11:31,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:11:31,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:11:31,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:11:31,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:11:31,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:11:31,237 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:11:31,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:11:31,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:11:31,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:11:31,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:11:31,238 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:11:31,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:11:31,238 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:11:31,239 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:11:31,239 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:11:31,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:11:31,239 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:11:31,239 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:11:31,239 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:11:31,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:11:31,239 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:11:31,239 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:11:31,239 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:11:31,239 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:11:31,239 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:11:31,240 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:11:31,240 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:11:31,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:11:31,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:11:31,240 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 -> b81cf2d80bc77dedaac253250be737ceaa09f6e691f026864fe6fd5cb48c2489 [2025-01-10 01:11:31,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:11:31,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:11:31,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:11:31,495 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:11:31,495 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:11:31,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-mult-4.wvr.c [2025-01-10 01:11:32,653 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67e3b1279/6ba19c4115b641efb6e02b49e1261f04/FLAG8a103ecb2 [2025-01-10 01:11:32,874 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:11:32,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-4.wvr.c [2025-01-10 01:11:32,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67e3b1279/6ba19c4115b641efb6e02b49e1261f04/FLAG8a103ecb2 [2025-01-10 01:11:33,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67e3b1279/6ba19c4115b641efb6e02b49e1261f04 [2025-01-10 01:11:33,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:11:33,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:11:33,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:11:33,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:11:33,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:11:33,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:11:33" (1/1) ... [2025-01-10 01:11:33,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f6975a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:33, skipping insertion in model container [2025-01-10 01:11:33,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:11:33" (1/1) ... [2025-01-10 01:11:33,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:11:33,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:11:33,368 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:11:33,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:11:33,400 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:11:33,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:33 WrapperNode [2025-01-10 01:11:33,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:11:33,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:11:33,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:11:33,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:11:33,405 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:11:33" (1/1) ... [2025-01-10 01:11:33,410 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:11:33" (1/1) ... [2025-01-10 01:11:33,422 INFO L138 Inliner]: procedures = 22, calls = 23, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 94 [2025-01-10 01:11:33,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:11:33,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:11:33,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:11:33,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:11:33,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:33" (1/1) ... [2025-01-10 01:11:33,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:33" (1/1) ... [2025-01-10 01:11:33,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:33" (1/1) ... [2025-01-10 01:11:33,445 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:11:33,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:33" (1/1) ... [2025-01-10 01:11:33,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:33" (1/1) ... [2025-01-10 01:11:33,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:33" (1/1) ... [2025-01-10 01:11:33,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:33" (1/1) ... [2025-01-10 01:11:33,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:33" (1/1) ... [2025-01-10 01:11:33,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:33" (1/1) ... [2025-01-10 01:11:33,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:33" (1/1) ... [2025-01-10 01:11:33,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:11:33,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:11:33,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:11:33,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:11:33,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:33" (1/1) ... [2025-01-10 01:11:33,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:11:33,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:33,489 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:11:33,490 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:11:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:11:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:11:33,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:11:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:11:33,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:11:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:11:33,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:11:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 01:11:33,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 01:11:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:11:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:11:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:11:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:11:33,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:11:33,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 01:11:33,576 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:11:33,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:11:33,728 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:11:33,729 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:11:33,816 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:11:33,816 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:11:33,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:11:33 BoogieIcfgContainer [2025-01-10 01:11:33,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:11:33,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:11:33,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:11:33,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:11:33,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:11:33" (1/3) ... [2025-01-10 01:11:33,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236d9eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:11:33, skipping insertion in model container [2025-01-10 01:11:33,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:33" (2/3) ... [2025-01-10 01:11:33,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236d9eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:11:33, skipping insertion in model container [2025-01-10 01:11:33,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:11:33" (3/3) ... [2025-01-10 01:11:33,827 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2025-01-10 01:11:33,837 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:11:33,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-mult-4.wvr.c that has 5 procedures, 39 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-01-10 01:11:33,838 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:11:33,901 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 01:11:33,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 112 flow [2025-01-10 01:11:33,957 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-01-10 01:11:33,960 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:11:33,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 38 events. 4/38 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-01-10 01:11:33,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 112 flow [2025-01-10 01:11:33,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 98 flow [2025-01-10 01:11:33,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:11:33,983 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;@286e870e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:11:33,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:11:33,998 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:11:33,999 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2025-01-10 01:11:33,999 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:11:33,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:33,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:34,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:11:34,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:34,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1537389798, now seen corresponding path program 1 times [2025-01-10 01:11:34,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:34,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141233705] [2025-01-10 01:11:34,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:34,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:34,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:11:34,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:11:34,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:34,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:34,372 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:11:34,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:34,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141233705] [2025-01-10 01:11:34,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141233705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:34,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:34,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:11:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549811267] [2025-01-10 01:11:34,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:34,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:11:34,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:34,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:11:34,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:11:34,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2025-01-10 01:11:34,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:11:34,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:34,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2025-01-10 01:11:34,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:34,775 INFO L124 PetriNetUnfolderBase]: 3042/4228 cut-off events. [2025-01-10 01:11:34,776 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2025-01-10 01:11:34,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8628 conditions, 4228 events. 3042/4228 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 18716 event pairs, 763 based on Foata normal form. 153/4371 useless extension candidates. Maximal degree in co-relation 7622. Up to 3203 conditions per place. [2025-01-10 01:11:34,803 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 46 selfloop transitions, 3 changer transitions 2/56 dead transitions. [2025-01-10 01:11:34,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 259 flow [2025-01-10 01:11:34,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:11:34,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:11:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-01-10 01:11:34,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6746031746031746 [2025-01-10 01:11:34,814 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 98 flow. Second operand 3 states and 85 transitions. [2025-01-10 01:11:34,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 259 flow [2025-01-10 01:11:34,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 229 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:11:34,827 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 101 flow [2025-01-10 01:11:34,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-01-10 01:11:34,830 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2025-01-10 01:11:34,832 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 101 flow [2025-01-10 01:11:34,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:11:34,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:34,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:34,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:11:34,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:11:34,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:34,834 INFO L85 PathProgramCache]: Analyzing trace with hash 456706889, now seen corresponding path program 1 times [2025-01-10 01:11:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637229915] [2025-01-10 01:11:34,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:34,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:34,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:11:34,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:11:34,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:34,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:35,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:35,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637229915] [2025-01-10 01:11:35,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637229915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:35,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:35,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:11:35,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410971897] [2025-01-10 01:11:35,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:35,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:35,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:35,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:35,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:11:35,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-10 01:11:35,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:11:35,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:35,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-10 01:11:35,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:35,956 INFO L124 PetriNetUnfolderBase]: 11922/15909 cut-off events. [2025-01-10 01:11:35,957 INFO L125 PetriNetUnfolderBase]: For 969/969 co-relation queries the response was YES. [2025-01-10 01:11:35,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33765 conditions, 15909 events. 11922/15909 cut-off events. For 969/969 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 79965 event pairs, 4318 based on Foata normal form. 0/12537 useless extension candidates. Maximal degree in co-relation 9444. Up to 8562 conditions per place. [2025-01-10 01:11:36,081 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 81 selfloop transitions, 10 changer transitions 0/96 dead transitions. [2025-01-10 01:11:36,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 96 transitions, 418 flow [2025-01-10 01:11:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:11:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:11:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-01-10 01:11:36,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-01-10 01:11:36,085 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 101 flow. Second operand 5 states and 134 transitions. [2025-01-10 01:11:36,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 96 transitions, 418 flow [2025-01-10 01:11:36,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 96 transitions, 415 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:11:36,088 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 165 flow [2025-01-10 01:11:36,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2025-01-10 01:11:36,089 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2025-01-10 01:11:36,089 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 165 flow [2025-01-10 01:11:36,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:11:36,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:36,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:36,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:11:36,091 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:11:36,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash -814958631, now seen corresponding path program 2 times [2025-01-10 01:11:36,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:36,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40589601] [2025-01-10 01:11:36,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:36,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:36,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:11:36,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:11:36,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:36,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:36,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:36,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40589601] [2025-01-10 01:11:36,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40589601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:36,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:36,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:11:36,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094673611] [2025-01-10 01:11:36,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:36,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:11:36,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:36,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:11:36,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:11:36,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-10 01:11:36,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:11:36,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:36,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-10 01:11:36,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:37,335 INFO L124 PetriNetUnfolderBase]: 17564/23591 cut-off events. [2025-01-10 01:11:37,335 INFO L125 PetriNetUnfolderBase]: For 10619/10697 co-relation queries the response was YES. [2025-01-10 01:11:37,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62097 conditions, 23591 events. 17564/23591 cut-off events. For 10619/10697 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 127691 event pairs, 3199 based on Foata normal form. 682/23853 useless extension candidates. Maximal degree in co-relation 35433. Up to 13004 conditions per place. [2025-01-10 01:11:37,458 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 85 selfloop transitions, 8 changer transitions 2/100 dead transitions. [2025-01-10 01:11:37,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 100 transitions, 538 flow [2025-01-10 01:11:37,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:11:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:11:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-01-10 01:11:37,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2025-01-10 01:11:37,460 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 165 flow. Second operand 4 states and 110 transitions. [2025-01-10 01:11:37,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 100 transitions, 538 flow [2025-01-10 01:11:37,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:11:37,470 INFO L231 Difference]: Finished difference. Result has 51 places, 54 transitions, 251 flow [2025-01-10 01:11:37,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=51, PETRI_TRANSITIONS=54} [2025-01-10 01:11:37,471 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2025-01-10 01:11:37,471 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 251 flow [2025-01-10 01:11:37,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:11:37,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:37,472 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:37,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:11:37,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:11:37,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:37,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1041623403, now seen corresponding path program 3 times [2025-01-10 01:11:37,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:37,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362716378] [2025-01-10 01:11:37,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:37,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:37,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:11:37,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:11:37,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:11:37,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:37,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:37,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362716378] [2025-01-10 01:11:37,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362716378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:37,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:37,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:11:37,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437349152] [2025-01-10 01:11:37,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:37,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:11:37,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:37,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:11:37,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:11:37,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-10 01:11:37,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 251 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:11:37,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:37,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-10 01:11:37,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:38,842 INFO L124 PetriNetUnfolderBase]: 23226/31034 cut-off events. [2025-01-10 01:11:38,842 INFO L125 PetriNetUnfolderBase]: For 29080/29156 co-relation queries the response was YES. [2025-01-10 01:11:38,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91457 conditions, 31034 events. 23226/31034 cut-off events. For 29080/29156 co-relation queries the response was YES. Maximal size of possible extension queue 1146. Compared 169184 event pairs, 6976 based on Foata normal form. 434/30863 useless extension candidates. Maximal degree in co-relation 34581. Up to 16023 conditions per place. [2025-01-10 01:11:39,046 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 89 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2025-01-10 01:11:39,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 104 transitions, 632 flow [2025-01-10 01:11:39,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:11:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:11:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-01-10 01:11:39,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2025-01-10 01:11:39,048 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 251 flow. Second operand 4 states and 110 transitions. [2025-01-10 01:11:39,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 104 transitions, 632 flow [2025-01-10 01:11:39,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 104 transitions, 632 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:11:39,065 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 311 flow [2025-01-10 01:11:39,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2025-01-10 01:11:39,066 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2025-01-10 01:11:39,066 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 311 flow [2025-01-10 01:11:39,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:11:39,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:39,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:39,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:11:39,067 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:11:39,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:39,067 INFO L85 PathProgramCache]: Analyzing trace with hash -325928465, now seen corresponding path program 1 times [2025-01-10 01:11:39,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:39,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041020892] [2025-01-10 01:11:39,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:39,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:39,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:11:39,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:11:39,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:39,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:39,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041020892] [2025-01-10 01:11:39,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041020892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:39,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:39,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:11:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532204728] [2025-01-10 01:11:39,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:39,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:39,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:39,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:39,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:11:39,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-10 01:11:39,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 311 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:11:39,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:39,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-10 01:11:39,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:40,673 INFO L124 PetriNetUnfolderBase]: 25180/33886 cut-off events. [2025-01-10 01:11:40,673 INFO L125 PetriNetUnfolderBase]: For 58992/59014 co-relation queries the response was YES. [2025-01-10 01:11:40,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108320 conditions, 33886 events. 25180/33886 cut-off events. For 58992/59014 co-relation queries the response was YES. Maximal size of possible extension queue 1256. Compared 191642 event pairs, 7668 based on Foata normal form. 762/33869 useless extension candidates. Maximal degree in co-relation 46081. Up to 15999 conditions per place. [2025-01-10 01:11:40,854 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 92 selfloop transitions, 7 changer transitions 17/121 dead transitions. [2025-01-10 01:11:40,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 121 transitions, 848 flow [2025-01-10 01:11:40,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:11:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:11:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-01-10 01:11:40,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-01-10 01:11:40,856 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 311 flow. Second operand 5 states and 135 transitions. [2025-01-10 01:11:40,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 121 transitions, 848 flow [2025-01-10 01:11:40,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 121 transitions, 783 flow, removed 23 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:40,884 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 325 flow [2025-01-10 01:11:40,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2025-01-10 01:11:40,885 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2025-01-10 01:11:40,885 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 325 flow [2025-01-10 01:11:40,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:11:40,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:40,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:40,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:11:40,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:11:40,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:40,886 INFO L85 PathProgramCache]: Analyzing trace with hash 574918407, now seen corresponding path program 4 times [2025-01-10 01:11:40,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:40,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930448627] [2025-01-10 01:11:40,887 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:11:40,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:40,894 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:11:40,904 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:11:40,907 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:11:40,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:40,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:40,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930448627] [2025-01-10 01:11:40,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930448627] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:40,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627090043] [2025-01-10 01:11:40,983 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:11:40,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:40,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:40,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:11:40,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:11:41,024 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:11:41,040 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:11:41,041 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:11:41,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:41,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:11:41,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:41,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:41,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627090043] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:41,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:41,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-01-10 01:11:41,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226290545] [2025-01-10 01:11:41,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:41,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:11:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:41,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:11:41,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:11:41,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-10 01:11:41,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 325 flow. Second operand has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:41,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:41,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-10 01:11:41,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:43,815 INFO L124 PetriNetUnfolderBase]: 29098/39399 cut-off events. [2025-01-10 01:11:43,815 INFO L125 PetriNetUnfolderBase]: For 79636/79660 co-relation queries the response was YES. [2025-01-10 01:11:43,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134682 conditions, 39399 events. 29098/39399 cut-off events. For 79636/79660 co-relation queries the response was YES. Maximal size of possible extension queue 1360. Compared 226849 event pairs, 1446 based on Foata normal form. 2938/41659 useless extension candidates. Maximal degree in co-relation 50659. Up to 8850 conditions per place. [2025-01-10 01:11:44,095 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 293 selfloop transitions, 103 changer transitions 12/413 dead transitions. [2025-01-10 01:11:44,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 413 transitions, 2748 flow [2025-01-10 01:11:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 01:11:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-10 01:11:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 598 transitions. [2025-01-10 01:11:44,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-01-10 01:11:44,097 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 325 flow. Second operand 23 states and 598 transitions. [2025-01-10 01:11:44,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 413 transitions, 2748 flow [2025-01-10 01:11:44,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 413 transitions, 2604 flow, removed 54 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:44,146 INFO L231 Difference]: Finished difference. Result has 97 places, 139 transitions, 1296 flow [2025-01-10 01:11:44,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1296, PETRI_PLACES=97, PETRI_TRANSITIONS=139} [2025-01-10 01:11:44,146 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 51 predicate places. [2025-01-10 01:11:44,146 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 139 transitions, 1296 flow [2025-01-10 01:11:44,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:44,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:44,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:44,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:11:44,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:44,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:11:44,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:44,348 INFO L85 PathProgramCache]: Analyzing trace with hash -384194123, now seen corresponding path program 1 times [2025-01-10 01:11:44,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:44,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403401600] [2025-01-10 01:11:44,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:44,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:44,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:11:44,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:11:44,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:44,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:44,459 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:11:44,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:44,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403401600] [2025-01-10 01:11:44,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403401600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:44,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:44,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:11:44,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035669662] [2025-01-10 01:11:44,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:44,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:44,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:44,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:44,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:11:44,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-10 01:11:44,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 139 transitions, 1296 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:11:44,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:44,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-10 01:11:44,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:48,395 INFO L124 PetriNetUnfolderBase]: 41589/56538 cut-off events. [2025-01-10 01:11:48,395 INFO L125 PetriNetUnfolderBase]: For 482947/483669 co-relation queries the response was YES. [2025-01-10 01:11:48,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277124 conditions, 56538 events. 41589/56538 cut-off events. For 482947/483669 co-relation queries the response was YES. Maximal size of possible extension queue 1787. Compared 340747 event pairs, 13772 based on Foata normal form. 988/56027 useless extension candidates. Maximal degree in co-relation 201812. Up to 28719 conditions per place. [2025-01-10 01:11:48,881 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 254 selfloop transitions, 23 changer transitions 16/298 dead transitions. [2025-01-10 01:11:48,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 298 transitions, 3368 flow [2025-01-10 01:11:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:11:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:11:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-01-10 01:11:48,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-01-10 01:11:48,882 INFO L175 Difference]: Start difference. First operand has 97 places, 139 transitions, 1296 flow. Second operand 5 states and 125 transitions. [2025-01-10 01:11:48,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 298 transitions, 3368 flow [2025-01-10 01:11:52,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 298 transitions, 2873 flow, removed 123 selfloop flow, removed 6 redundant places. [2025-01-10 01:11:52,046 INFO L231 Difference]: Finished difference. Result has 95 places, 149 transitions, 1289 flow [2025-01-10 01:11:52,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1289, PETRI_PLACES=95, PETRI_TRANSITIONS=149} [2025-01-10 01:11:52,047 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 49 predicate places. [2025-01-10 01:11:52,047 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 149 transitions, 1289 flow [2025-01-10 01:11:52,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:11:52,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:52,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:52,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:11:52,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:11:52,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:52,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1149236279, now seen corresponding path program 2 times [2025-01-10 01:11:52,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:52,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062971994] [2025-01-10 01:11:52,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:52,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-10 01:11:52,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:11:52,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:52,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:52,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062971994] [2025-01-10 01:11:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062971994] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806199423] [2025-01-10 01:11:52,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:52,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:52,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:52,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:11:52,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:11:52,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-10 01:11:52,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:11:52,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:52,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:52,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:11:52,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:11:52,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:11:52,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806199423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:52,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:11:52,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-01-10 01:11:52,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174133102] [2025-01-10 01:11:52,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:52,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:52,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:52,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:52,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:11:52,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-10 01:11:52,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 149 transitions, 1289 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:11:52,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:52,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-10 01:11:52,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:56,780 INFO L124 PetriNetUnfolderBase]: 49839/67277 cut-off events. [2025-01-10 01:11:56,780 INFO L125 PetriNetUnfolderBase]: For 664834/665495 co-relation queries the response was YES. [2025-01-10 01:11:57,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346504 conditions, 67277 events. 49839/67277 cut-off events. For 664834/665495 co-relation queries the response was YES. Maximal size of possible extension queue 2273. Compared 411131 event pairs, 14839 based on Foata normal form. 524/65589 useless extension candidates. Maximal degree in co-relation 317338. Up to 39641 conditions per place. [2025-01-10 01:11:57,567 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 218 selfloop transitions, 35 changer transitions 3/261 dead transitions. [2025-01-10 01:11:57,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 261 transitions, 2888 flow [2025-01-10 01:11:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:11:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:11:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-01-10 01:11:57,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2025-01-10 01:11:57,568 INFO L175 Difference]: Start difference. First operand has 95 places, 149 transitions, 1289 flow. Second operand 5 states and 123 transitions. [2025-01-10 01:11:57,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 261 transitions, 2888 flow [2025-01-10 01:12:04,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 261 transitions, 2812 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:04,201 INFO L231 Difference]: Finished difference. Result has 99 places, 168 transitions, 1529 flow [2025-01-10 01:12:04,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1529, PETRI_PLACES=99, PETRI_TRANSITIONS=168} [2025-01-10 01:12:04,202 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 53 predicate places. [2025-01-10 01:12:04,202 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 168 transitions, 1529 flow [2025-01-10 01:12:04,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:12:04,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:04,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:04,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:12:04,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:04,404 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:12:04,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:04,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1121817425, now seen corresponding path program 3 times [2025-01-10 01:12:04,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:04,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345367446] [2025-01-10 01:12:04,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:12:04,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:04,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:12:04,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:12:04,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:12:04,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:04,505 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:12:04,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:04,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345367446] [2025-01-10 01:12:04,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345367446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:04,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:04,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:12:04,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343728003] [2025-01-10 01:12:04,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:04,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:12:04,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:04,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:12:04,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:12:04,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-10 01:12:04,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 168 transitions, 1529 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:12:04,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:04,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-10 01:12:04,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:09,162 INFO L124 PetriNetUnfolderBase]: 54826/74168 cut-off events. [2025-01-10 01:12:09,162 INFO L125 PetriNetUnfolderBase]: For 809661/809853 co-relation queries the response was YES. [2025-01-10 01:12:09,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396052 conditions, 74168 events. 54826/74168 cut-off events. For 809661/809853 co-relation queries the response was YES. Maximal size of possible extension queue 2509. Compared 456002 event pairs, 17136 based on Foata normal form. 1538/73921 useless extension candidates. Maximal degree in co-relation 320410. Up to 36039 conditions per place. [2025-01-10 01:12:10,121 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 322 selfloop transitions, 88 changer transitions 3/418 dead transitions. [2025-01-10 01:12:10,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 418 transitions, 4785 flow [2025-01-10 01:12:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:12:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:12:10,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2025-01-10 01:12:10,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-01-10 01:12:10,122 INFO L175 Difference]: Start difference. First operand has 99 places, 168 transitions, 1529 flow. Second operand 6 states and 152 transitions. [2025-01-10 01:12:10,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 418 transitions, 4785 flow [2025-01-10 01:12:18,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 418 transitions, 4684 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:12:18,629 INFO L231 Difference]: Finished difference. Result has 107 places, 229 transitions, 2594 flow [2025-01-10 01:12:18,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1497, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2594, PETRI_PLACES=107, PETRI_TRANSITIONS=229} [2025-01-10 01:12:18,630 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 61 predicate places. [2025-01-10 01:12:18,630 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 229 transitions, 2594 flow [2025-01-10 01:12:18,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:12:18,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:18,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:18,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:12:18,630 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:12:18,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:18,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1301414040, now seen corresponding path program 1 times [2025-01-10 01:12:18,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:18,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29514316] [2025-01-10 01:12:18,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:18,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:18,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:12:18,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:12:18,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:18,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:12:18,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:18,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29514316] [2025-01-10 01:12:18,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29514316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:18,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:18,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:12:18,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220964334] [2025-01-10 01:12:18,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:18,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:12:18,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:18,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:12:18,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:12:18,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-10 01:12:18,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 229 transitions, 2594 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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:12:18,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:18,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-10 01:12:18,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand