./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:18:08,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:18:08,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:18:08,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:18:08,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:18:08,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:18:08,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:18:08,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:18:08,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:18:08,575 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:18:08,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:18:08,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:18:08,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:18:08,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:18:08,576 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:18:08,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:18:08,576 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:18:08,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:18:08,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:18:08,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:18:08,576 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:18:08,576 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:18:08,576 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:18:08,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:18:08,576 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:18:08,577 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:18:08,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:18:08,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:18:08,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:18:08,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:18:08,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:18:08,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:18:08,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:18:08,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:08,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:18:08,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:18:08,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:18:08,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:18:08,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:18:08,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:18:08,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:18:08,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:18:08,578 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/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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 [2025-03-04 10:18:08,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:18:08,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:18:08,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:18:08,814 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:18:08,814 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:18:08,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2025-03-04 10:18:09,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a85d013/13e637dca12c4b1fbb6b1f799e48f31c/FLAG883242c0f [2025-03-04 10:18:10,227 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:18:10,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2025-03-04 10:18:10,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a85d013/13e637dca12c4b1fbb6b1f799e48f31c/FLAG883242c0f [2025-03-04 10:18:10,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a85d013/13e637dca12c4b1fbb6b1f799e48f31c [2025-03-04 10:18:10,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:18:10,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:18:10,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:10,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:18:10,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:18:10,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:10" (1/1) ... [2025-03-04 10:18:10,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@150732d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10, skipping insertion in model container [2025-03-04 10:18:10,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:10" (1/1) ... [2025-03-04 10:18:10,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:18:10,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:10,547 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:18:10,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:10,631 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:18:10,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10 WrapperNode [2025-03-04 10:18:10,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:10,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:10,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:18:10,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:18:10,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10" (1/1) ... [2025-03-04 10:18:10,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10" (1/1) ... [2025-03-04 10:18:10,670 INFO L138 Inliner]: procedures = 243, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 262 [2025-03-04 10:18:10,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:10,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:18:10,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:18:10,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:18:10,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10" (1/1) ... [2025-03-04 10:18:10,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10" (1/1) ... [2025-03-04 10:18:10,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10" (1/1) ... [2025-03-04 10:18:10,695 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2025-03-04 10:18:10,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10" (1/1) ... [2025-03-04 10:18:10,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10" (1/1) ... [2025-03-04 10:18:10,704 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10" (1/1) ... [2025-03-04 10:18:10,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10" (1/1) ... [2025-03-04 10:18:10,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10" (1/1) ... [2025-03-04 10:18:10,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10" (1/1) ... [2025-03-04 10:18:10,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:18:10,710 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:18:10,710 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:18:10,710 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:18:10,711 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10" (1/1) ... [2025-03-04 10:18:10,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:10,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:10,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:18:10,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:18:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:18:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:18:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 10:18:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:18:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:18:10,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:18:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:18:10,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:18:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:18:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:18:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:18:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:18:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:18:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:18:10,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:18:10,749 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:18:10,845 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:18:10,846 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:18:11,101 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:18:11,101 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:18:11,581 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:18:11,581 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:18:11,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:11 BoogieIcfgContainer [2025-03-04 10:18:11,582 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:18:11,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:18:11,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:18:11,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:18:11,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:18:10" (1/3) ... [2025-03-04 10:18:11,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c71fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:11, skipping insertion in model container [2025-03-04 10:18:11,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:10" (2/3) ... [2025-03-04 10:18:11,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c71fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:11, skipping insertion in model container [2025-03-04 10:18:11,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:11" (3/3) ... [2025-03-04 10:18:11,590 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2025-03-04 10:18:11,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:18:11,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG arithmetic_prog_bad.i that has 3 procedures, 37 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-03-04 10:18:11,627 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:18:11,676 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:18:11,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 100 flow [2025-03-04 10:18:11,742 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2025-03-04 10:18:11,744 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:11,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 7/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-03-04 10:18:11,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 43 transitions, 100 flow [2025-03-04 10:18:11,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 40 transitions, 92 flow [2025-03-04 10:18:11,757 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:18:11,769 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;@76533c7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:18:11,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:18:11,799 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:18:11,800 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2025-03-04 10:18:11,800 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:11,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:11,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:11,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:11,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:11,805 INFO L85 PathProgramCache]: Analyzing trace with hash 513080561, now seen corresponding path program 1 times [2025-03-04 10:18:11,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:11,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984677716] [2025-03-04 10:18:11,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:11,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:12,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:18:12,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:18:12,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:12,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:12,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:12,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984677716] [2025-03-04 10:18:12,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984677716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:12,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:12,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:12,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934653525] [2025-03-04 10:18:12,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:12,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:12,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:12,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:12,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:12,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-04 10:18:12,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-03-04 10:18:12,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:12,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-04 10:18:12,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:12,637 INFO L124 PetriNetUnfolderBase]: 439/786 cut-off events. [2025-03-04 10:18:12,637 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 10:18:12,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 786 events. 439/786 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3660 event pairs, 172 based on Foata normal form. 20/777 useless extension candidates. Maximal degree in co-relation 1436. Up to 416 conditions per place. [2025-03-04 10:18:12,643 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 39 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-03-04 10:18:12,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 205 flow [2025-03-04 10:18:12,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-04 10:18:12,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2025-03-04 10:18:12,655 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 92 flow. Second operand 3 states and 89 transitions. [2025-03-04 10:18:12,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 205 flow [2025-03-04 10:18:12,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 195 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:12,663 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 90 flow [2025-03-04 10:18:12,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2025-03-04 10:18:12,667 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-03-04 10:18:12,668 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 90 flow [2025-03-04 10:18:12,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-03-04 10:18:12,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:12,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:12,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:18:12,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:12,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1868221857, now seen corresponding path program 1 times [2025-03-04 10:18:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:12,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695092782] [2025-03-04 10:18:12,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:12,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:12,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:18:12,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:18:12,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:12,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:12,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:12,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695092782] [2025-03-04 10:18:12,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695092782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:12,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:12,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:12,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973895583] [2025-03-04 10:18:12,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:12,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:12,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:12,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:12,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:12,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-04 10:18:12,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03-04 10:18:12,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:12,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-04 10:18:12,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:13,127 INFO L124 PetriNetUnfolderBase]: 742/1327 cut-off events. [2025-03-04 10:18:13,127 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-03-04 10:18:13,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2615 conditions, 1327 events. 742/1327 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6742 event pairs, 300 based on Foata normal form. 29/1324 useless extension candidates. Maximal degree in co-relation 964. Up to 697 conditions per place. [2025-03-04 10:18:13,137 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 40 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-03-04 10:18:13,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 219 flow [2025-03-04 10:18:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-04 10:18:13,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 10:18:13,141 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 90 flow. Second operand 3 states and 86 transitions. [2025-03-04 10:18:13,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 219 flow [2025-03-04 10:18:13,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:13,142 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 100 flow [2025-03-04 10:18:13,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-03-04 10:18:13,143 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2025-03-04 10:18:13,143 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 100 flow [2025-03-04 10:18:13,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03-04 10:18:13,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:13,144 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-03-04 10:18:13,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:18:13,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:13,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:13,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1774076939, now seen corresponding path program 1 times [2025-03-04 10:18:13,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:13,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198947805] [2025-03-04 10:18:13,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:13,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:13,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:18:13,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:13,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:13,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:13,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:13,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198947805] [2025-03-04 10:18:13,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198947805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:13,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:13,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:13,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325886182] [2025-03-04 10:18:13,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:13,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:13,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:13,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:13,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:13,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-04 10:18:13,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-03-04 10:18:13,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:13,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-04 10:18:13,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:13,549 INFO L124 PetriNetUnfolderBase]: 428/901 cut-off events. [2025-03-04 10:18:13,550 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2025-03-04 10:18:13,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 901 events. 428/901 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4338 event pairs, 182 based on Foata normal form. 64/959 useless extension candidates. Maximal degree in co-relation 607. Up to 373 conditions per place. [2025-03-04 10:18:13,554 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 30 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2025-03-04 10:18:13,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 220 flow [2025-03-04 10:18:13,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-04 10:18:13,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-03-04 10:18:13,556 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 100 flow. Second operand 3 states and 83 transitions. [2025-03-04 10:18:13,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 220 flow [2025-03-04 10:18:13,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:13,557 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 114 flow [2025-03-04 10:18:13,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2025-03-04 10:18:13,557 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2025-03-04 10:18:13,557 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 114 flow [2025-03-04 10:18:13,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-03-04 10:18:13,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:13,558 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-03-04 10:18:13,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:18:13,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:13,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash -161148959, now seen corresponding path program 2 times [2025-03-04 10:18:13,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:13,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841053771] [2025-03-04 10:18:13,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:13,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:13,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:18:13,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:13,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:13,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:13,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:13,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841053771] [2025-03-04 10:18:13,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841053771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:13,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:13,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:18:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600566994] [2025-03-04 10:18:13,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:13,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:13,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:13,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:13,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:13,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-04 10:18:13,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-03-04 10:18:13,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:13,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-04 10:18:13,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:13,944 INFO L124 PetriNetUnfolderBase]: 627/1306 cut-off events. [2025-03-04 10:18:13,944 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2025-03-04 10:18:13,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 1306 events. 627/1306 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6846 event pairs, 183 based on Foata normal form. 30/1316 useless extension candidates. Maximal degree in co-relation 762. Up to 480 conditions per place. [2025-03-04 10:18:13,952 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 58 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-03-04 10:18:13,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 358 flow [2025-03-04 10:18:13,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-03-04 10:18:13,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2025-03-04 10:18:13,955 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 114 flow. Second operand 4 states and 119 transitions. [2025-03-04 10:18:13,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 74 transitions, 358 flow [2025-03-04 10:18:13,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:13,959 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 122 flow [2025-03-04 10:18:13,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2025-03-04 10:18:13,961 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2025-03-04 10:18:13,961 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 122 flow [2025-03-04 10:18:13,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-03-04 10:18:13,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:13,961 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:13,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:18:13,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:13,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:13,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1674157639, now seen corresponding path program 3 times [2025-03-04 10:18:13,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:13,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466710534] [2025-03-04 10:18:13,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:13,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:14,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-03-04 10:18:14,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 32 statements. [2025-03-04 10:18:14,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:18:14,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:18:14,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:14,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466710534] [2025-03-04 10:18:14,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466710534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:14,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:14,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:18:14,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175167107] [2025-03-04 10:18:14,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:14,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:14,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:14,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:14,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:14,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-04 10:18:14,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-03-04 10:18:14,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:14,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-04 10:18:14,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:14,389 INFO L124 PetriNetUnfolderBase]: 849/1796 cut-off events. [2025-03-04 10:18:14,389 INFO L125 PetriNetUnfolderBase]: For 834/834 co-relation queries the response was YES. [2025-03-04 10:18:14,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4138 conditions, 1796 events. 849/1796 cut-off events. For 834/834 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 9888 event pairs, 258 based on Foata normal form. 41/1814 useless extension candidates. Maximal degree in co-relation 1304. Up to 667 conditions per place. [2025-03-04 10:18:14,397 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 59 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-03-04 10:18:14,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 75 transitions, 380 flow [2025-03-04 10:18:14,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-04 10:18:14,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6802325581395349 [2025-03-04 10:18:14,401 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 122 flow. Second operand 4 states and 117 transitions. [2025-03-04 10:18:14,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 75 transitions, 380 flow [2025-03-04 10:18:14,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 75 transitions, 362 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:14,404 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 132 flow [2025-03-04 10:18:14,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-03-04 10:18:14,404 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-03-04 10:18:14,406 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 132 flow [2025-03-04 10:18:14,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-03-04 10:18:14,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:14,406 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:14,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:18:14,406 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:14,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:14,407 INFO L85 PathProgramCache]: Analyzing trace with hash 756874577, now seen corresponding path program 4 times [2025-03-04 10:18:14,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:14,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297823808] [2025-03-04 10:18:14,407 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:14,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:14,600 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:18:14,603 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 38 statements. [2025-03-04 10:18:14,603 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:18:14,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:18:14,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:14,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297823808] [2025-03-04 10:18:14,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297823808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:14,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:14,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:14,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510734658] [2025-03-04 10:18:14,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:14,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:14,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:14,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:14,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:14,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:18:14,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03-04 10:18:14,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:14,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:18:14,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:14,780 INFO L124 PetriNetUnfolderBase]: 874/1809 cut-off events. [2025-03-04 10:18:14,780 INFO L125 PetriNetUnfolderBase]: For 867/867 co-relation queries the response was YES. [2025-03-04 10:18:14,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4321 conditions, 1809 events. 874/1809 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 9841 event pairs, 567 based on Foata normal form. 1/1779 useless extension candidates. Maximal degree in co-relation 1533. Up to 1355 conditions per place. [2025-03-04 10:18:14,787 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 39 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2025-03-04 10:18:14,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 255 flow [2025-03-04 10:18:14,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-04 10:18:14,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5968992248062015 [2025-03-04 10:18:14,788 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 132 flow. Second operand 3 states and 77 transitions. [2025-03-04 10:18:14,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 255 flow [2025-03-04 10:18:14,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 249 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:14,790 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 126 flow [2025-03-04 10:18:14,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2025-03-04 10:18:14,790 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-03-04 10:18:14,791 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 126 flow [2025-03-04 10:18:14,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03-04 10:18:14,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:14,791 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:14,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:18:14,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:14,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash 419269280, now seen corresponding path program 1 times [2025-03-04 10:18:14,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:14,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401999206] [2025-03-04 10:18:14,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:14,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:14,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:18:14,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:18:14,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:14,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:18:14,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:14,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401999206] [2025-03-04 10:18:14,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401999206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:14,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:14,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:14,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652333032] [2025-03-04 10:18:14,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:14,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:14,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:14,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:14,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:14,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:18:14,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03-04 10:18:14,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:14,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:18:14,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:15,140 INFO L124 PetriNetUnfolderBase]: 874/1808 cut-off events. [2025-03-04 10:18:15,140 INFO L125 PetriNetUnfolderBase]: For 702/702 co-relation queries the response was YES. [2025-03-04 10:18:15,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4254 conditions, 1808 events. 874/1808 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 9864 event pairs, 626 based on Foata normal form. 1/1778 useless extension candidates. Maximal degree in co-relation 3852. Up to 1470 conditions per place. [2025-03-04 10:18:15,149 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 27 selfloop transitions, 1 changer transitions 2/39 dead transitions. [2025-03-04 10:18:15,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 180 flow [2025-03-04 10:18:15,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-03-04 10:18:15,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2025-03-04 10:18:15,150 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 126 flow. Second operand 3 states and 67 transitions. [2025-03-04 10:18:15,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 180 flow [2025-03-04 10:18:15,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:15,154 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 121 flow [2025-03-04 10:18:15,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-03-04 10:18:15,155 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-03-04 10:18:15,155 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 121 flow [2025-03-04 10:18:15,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03-04 10:18:15,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:15,155 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:15,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:18:15,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:15,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash 33476740, now seen corresponding path program 1 times [2025-03-04 10:18:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:15,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016422292] [2025-03-04 10:18:15,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:15,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:15,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:18:15,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:18:15,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:15,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:15,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016422292] [2025-03-04 10:18:15,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016422292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653915542] [2025-03-04 10:18:15,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:15,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:15,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:15,408 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:15,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:18:15,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:18:15,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:18:15,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:15,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:15,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:18:15,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:15,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:15,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653915542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:15,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:15,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-04 10:18:15,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837936550] [2025-03-04 10:18:15,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:15,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:15,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:15,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:15,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:15,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:18:15,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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-03-04 10:18:15,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:15,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:18:15,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:16,164 INFO L124 PetriNetUnfolderBase]: 1123/2188 cut-off events. [2025-03-04 10:18:16,164 INFO L125 PetriNetUnfolderBase]: For 807/807 co-relation queries the response was YES. [2025-03-04 10:18:16,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5142 conditions, 2188 events. 1123/2188 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 11520 event pairs, 185 based on Foata normal form. 42/2214 useless extension candidates. Maximal degree in co-relation 5131. Up to 547 conditions per place. [2025-03-04 10:18:16,176 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 76 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2025-03-04 10:18:16,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 89 transitions, 461 flow [2025-03-04 10:18:16,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2025-03-04 10:18:16,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6697674418604651 [2025-03-04 10:18:16,177 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 121 flow. Second operand 5 states and 144 transitions. [2025-03-04 10:18:16,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 89 transitions, 461 flow [2025-03-04 10:18:16,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:16,180 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 142 flow [2025-03-04 10:18:16,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2025-03-04 10:18:16,181 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2025-03-04 10:18:16,182 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 142 flow [2025-03-04 10:18:16,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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-03-04 10:18:16,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:16,182 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:16,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:18:16,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:16,383 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:16,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 178359158, now seen corresponding path program 2 times [2025-03-04 10:18:16,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:16,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379143502] [2025-03-04 10:18:16,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:16,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:16,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 10:18:16,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:18:16,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:18:16,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:18:16,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:16,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379143502] [2025-03-04 10:18:16,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379143502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:16,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359021997] [2025-03-04 10:18:16,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:16,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:16,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:16,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:16,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:18:16,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 10:18:17,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:18:17,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:18:17,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:17,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:18:17,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:18:17,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:18:17,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359021997] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:17,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:17,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-04 10:18:17,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255359546] [2025-03-04 10:18:17,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:17,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:17,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:17,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:17,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:17,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:18:17,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-03-04 10:18:17,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:17,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:18:17,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:17,314 INFO L124 PetriNetUnfolderBase]: 1159/2258 cut-off events. [2025-03-04 10:18:17,314 INFO L125 PetriNetUnfolderBase]: For 1679/1679 co-relation queries the response was YES. [2025-03-04 10:18:17,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5635 conditions, 2258 events. 1159/2258 cut-off events. For 1679/1679 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 12061 event pairs, 165 based on Foata normal form. 43/2287 useless extension candidates. Maximal degree in co-relation 5623. Up to 554 conditions per place. [2025-03-04 10:18:17,325 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 73 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2025-03-04 10:18:17,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 509 flow [2025-03-04 10:18:17,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2025-03-04 10:18:17,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6558139534883721 [2025-03-04 10:18:17,326 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 142 flow. Second operand 5 states and 141 transitions. [2025-03-04 10:18:17,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 509 flow [2025-03-04 10:18:17,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 477 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:17,330 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 156 flow [2025-03-04 10:18:17,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-03-04 10:18:17,330 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2025-03-04 10:18:17,331 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 156 flow [2025-03-04 10:18:17,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-03-04 10:18:17,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:17,331 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:17,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:17,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-04 10:18:17,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:17,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:17,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1849904690, now seen corresponding path program 3 times [2025-03-04 10:18:17,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:17,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160592095] [2025-03-04 10:18:17,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:17,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:17,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 4 equivalence classes. [2025-03-04 10:18:17,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:18:17,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 10:18:17,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:17,948 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:18:17,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:17,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160592095] [2025-03-04 10:18:17,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160592095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:17,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416030129] [2025-03-04 10:18:17,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:17,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:17,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:17,952 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:17,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:18:18,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 4 equivalence classes. [2025-03-04 10:18:18,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:18:18,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 10:18:18,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:18,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:18:18,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:18:18,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:18:18,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416030129] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:18,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:18,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2025-03-04 10:18:18,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177037126] [2025-03-04 10:18:18,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:18,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:18,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:18,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:18,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:18,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-04 10:18:18,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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-03-04 10:18:18,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:18,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-04 10:18:18,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:18,522 INFO L124 PetriNetUnfolderBase]: 448/983 cut-off events. [2025-03-04 10:18:18,522 INFO L125 PetriNetUnfolderBase]: For 997/999 co-relation queries the response was YES. [2025-03-04 10:18:18,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2660 conditions, 983 events. 448/983 cut-off events. For 997/999 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4011 event pairs, 123 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 2646. Up to 436 conditions per place. [2025-03-04 10:18:18,527 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 46 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-03-04 10:18:18,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 348 flow [2025-03-04 10:18:18,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-03-04 10:18:18,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563953488372093 [2025-03-04 10:18:18,528 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 156 flow. Second operand 4 states and 97 transitions. [2025-03-04 10:18:18,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 348 flow [2025-03-04 10:18:18,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 332 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:18,530 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 163 flow [2025-03-04 10:18:18,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2025-03-04 10:18:18,530 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2025-03-04 10:18:18,530 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 163 flow [2025-03-04 10:18:18,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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-03-04 10:18:18,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:18,531 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:18,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:18:18,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:18,731 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:18,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:18,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1064155856, now seen corresponding path program 4 times [2025-03-04 10:18:18,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:18,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238710824] [2025-03-04 10:18:18,732 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:18,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:18,894 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-03-04 10:18:18,913 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:18:18,913 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:18,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:18:18,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:18:18,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:18:18,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:18:18,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:18,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:18:18,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:18:18,964 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:18:18,965 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-03-04 10:18:18,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-04 10:18:18,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-04 10:18:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-04 10:18:18,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:18:18,967 INFO L422 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1] [2025-03-04 10:18:19,028 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:18:19,028 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:18:19,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:18:19 BasicIcfg [2025-03-04 10:18:19,034 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:18:19,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:18:19,034 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:18:19,034 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:18:19,036 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:11" (3/4) ... [2025-03-04 10:18:19,037 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 10:18:19,038 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:18:19,039 INFO L158 Benchmark]: Toolchain (without parser) took 8774.34ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 119.2MB in the beginning and 337.2MB in the end (delta: -218.0MB). Peak memory consumption was 119.4MB. Max. memory is 16.1GB. [2025-03-04 10:18:19,039 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:19,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.70ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 91.3MB in the end (delta: 27.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 10:18:19,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.58ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 88.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:19,040 INFO L158 Benchmark]: Boogie Preprocessor took 38.46ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 85.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:19,040 INFO L158 Benchmark]: IcfgBuilder took 871.59ms. Allocated memory is still 167.8MB. Free memory was 85.6MB in the beginning and 54.6MB in the end (delta: 31.0MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2025-03-04 10:18:19,040 INFO L158 Benchmark]: TraceAbstraction took 7450.62ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 53.7MB in the beginning and 337.3MB in the end (delta: -283.5MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2025-03-04 10:18:19,040 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 503.3MB. Free memory was 337.3MB in the beginning and 337.2MB in the end (delta: 68.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:19,041 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.70ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 91.3MB in the end (delta: 27.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.58ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 88.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.46ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 85.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 871.59ms. Allocated memory is still 167.8MB. Free memory was 85.6MB in the beginning and 54.6MB in the end (delta: 31.0MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7450.62ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 53.7MB in the beginning and 337.3MB in the end (delta: -283.5MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 503.3MB. Free memory was 337.3MB in the beginning and 337.2MB in the end (delta: 68.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=-1, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=-1, t2=0, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, t1=-1, t2=0, total=1] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-1, t2=0, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-1, t2=0, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) [L919] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] [L18] 0 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] - UnprovableResult [Line: 906]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 914]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.3s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 777 IncrementalHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 2 mSDtfsCounter, 777 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 273 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=10, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 516 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1409 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 155/205 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 10:18:19,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:18:20,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:18:21,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 10:18:21,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:18:21,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:18:21,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:18:21,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:18:21,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:18:21,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:18:21,099 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:18:21,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:18:21,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:18:21,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:18:21,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:18:21,100 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:18:21,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:18:21,100 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:18:21,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:18:21,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:18:21,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:18:21,101 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:18:21,101 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:18:21,101 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:18:21,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:18:21,101 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:18:21,101 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 10:18:21,101 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 10:18:21,101 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:18:21,101 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:18:21,101 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:18:21,101 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:18:21,101 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:18:21,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:18:21,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:18:21,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:18:21,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:21,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:18:21,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:18:21,102 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 10:18:21,102 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 10:18:21,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:18:21,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:18:21,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:18:21,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:18:21,102 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/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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 [2025-03-04 10:18:21,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:18:21,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:18:21,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:18:21,361 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:18:21,361 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:18:21,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2025-03-04 10:18:22,565 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d37eee11/acbf2818b17949aeace46f79b3981799/FLAG645631447 [2025-03-04 10:18:22,807 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:18:22,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2025-03-04 10:18:22,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d37eee11/acbf2818b17949aeace46f79b3981799/FLAG645631447 [2025-03-04 10:18:22,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d37eee11/acbf2818b17949aeace46f79b3981799 [2025-03-04 10:18:22,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:18:22,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:18:22,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:22,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:18:22,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:18:22,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:22" (1/1) ... [2025-03-04 10:18:22,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ba7e286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:22, skipping insertion in model container [2025-03-04 10:18:22,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:22" (1/1) ... [2025-03-04 10:18:22,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:18:23,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:23,128 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:18:23,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:23,212 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:18:23,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:23 WrapperNode [2025-03-04 10:18:23,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:23,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:23,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:18:23,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:18:23,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:23" (1/1) ... [2025-03-04 10:18:23,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:23" (1/1) ... [2025-03-04 10:18:23,267 INFO L138 Inliner]: procedures = 250, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 263 [2025-03-04 10:18:23,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:23,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:18:23,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:18:23,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:18:23,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:23" (1/1) ... [2025-03-04 10:18:23,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:23" (1/1) ... [2025-03-04 10:18:23,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:23" (1/1) ... [2025-03-04 10:18:23,299 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2025-03-04 10:18:23,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:23" (1/1) ... [2025-03-04 10:18:23,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:23" (1/1) ... [2025-03-04 10:18:23,314 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:23" (1/1) ... [2025-03-04 10:18:23,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:23" (1/1) ... [2025-03-04 10:18:23,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:23" (1/1) ... [2025-03-04 10:18:23,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:23" (1/1) ... [2025-03-04 10:18:23,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:18:23,332 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:18:23,333 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:18:23,333 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:18:23,334 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:23" (1/1) ... [2025-03-04 10:18:23,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:23,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:23,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:18:23,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:18:23,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:18:23,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:18:23,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:18:23,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:18:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:18:23,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:18:23,393 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:18:23,515 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:18:23,517 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:18:23,875 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:18:23,875 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:18:24,382 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:18:24,383 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:18:24,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:24 BoogieIcfgContainer [2025-03-04 10:18:24,384 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:18:24,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:18:24,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:18:24,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:18:24,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:18:22" (1/3) ... [2025-03-04 10:18:24,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adc2dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:24, skipping insertion in model container [2025-03-04 10:18:24,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:23" (2/3) ... [2025-03-04 10:18:24,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adc2dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:24, skipping insertion in model container [2025-03-04 10:18:24,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:24" (3/3) ... [2025-03-04 10:18:24,392 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2025-03-04 10:18:24,403 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:18:24,404 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG arithmetic_prog_bad.i that has 3 procedures, 37 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-03-04 10:18:24,404 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:18:24,464 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:18:24,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 100 flow [2025-03-04 10:18:24,520 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2025-03-04 10:18:24,523 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:24,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 7/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-03-04 10:18:24,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 43 transitions, 100 flow [2025-03-04 10:18:24,529 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 40 transitions, 92 flow [2025-03-04 10:18:24,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:18:24,547 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;@7e35c0c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:18:24,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:18:24,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:18:24,573 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2025-03-04 10:18:24,573 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:24,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:24,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:24,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:24,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:24,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1186246321, now seen corresponding path program 1 times [2025-03-04 10:18:24,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:24,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1037902057] [2025-03-04 10:18:24,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:24,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:24,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:24,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:24,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:18:24,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:18:24,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:18:24,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:24,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:24,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:18:25,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:25,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:25,041 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:25,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037902057] [2025-03-04 10:18:25,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037902057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:25,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:25,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:25,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747799317] [2025-03-04 10:18:25,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:25,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:25,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:25,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:25,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:25,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:18:25,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-03-04 10:18:25,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:25,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:18:25,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:25,226 INFO L124 PetriNetUnfolderBase]: 265/464 cut-off events. [2025-03-04 10:18:25,226 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-04 10:18:25,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 464 events. 265/464 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1933 event pairs, 167 based on Foata normal form. 3/438 useless extension candidates. Maximal degree in co-relation 838. Up to 411 conditions per place. [2025-03-04 10:18:25,233 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 23 selfloop transitions, 1 changer transitions 3/36 dead transitions. [2025-03-04 10:18:25,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 132 flow [2025-03-04 10:18:25,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:25,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-04 10:18:25,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2025-03-04 10:18:25,244 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 92 flow. Second operand 3 states and 69 transitions. [2025-03-04 10:18:25,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 132 flow [2025-03-04 10:18:25,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:25,253 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 72 flow [2025-03-04 10:18:25,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2025-03-04 10:18:25,258 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-03-04 10:18:25,258 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 72 flow [2025-03-04 10:18:25,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-03-04 10:18:25,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:25,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:25,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:18:25,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:25,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:25,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:25,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1666427810, now seen corresponding path program 1 times [2025-03-04 10:18:25,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:25,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241276401] [2025-03-04 10:18:25,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:25,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:25,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:25,466 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:25,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:18:25,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:18:25,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:18:25,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:25,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:25,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:18:25,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:25,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:25,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:25,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241276401] [2025-03-04 10:18:25,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241276401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:25,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:25,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:25,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611897619] [2025-03-04 10:18:25,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:25,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:25,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:25,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:25,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:25,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-04 10:18:25,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-04 10:18:25,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:25,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-04 10:18:25,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:26,062 INFO L124 PetriNetUnfolderBase]: 547/978 cut-off events. [2025-03-04 10:18:26,062 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 10:18:26,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 978 events. 547/978 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4409 event pairs, 98 based on Foata normal form. 17/968 useless extension candidates. Maximal degree in co-relation 1814. Up to 341 conditions per place. [2025-03-04 10:18:26,067 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 50 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2025-03-04 10:18:26,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 64 transitions, 246 flow [2025-03-04 10:18:26,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-04 10:18:26,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2025-03-04 10:18:26,068 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 72 flow. Second operand 4 states and 116 transitions. [2025-03-04 10:18:26,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 64 transitions, 246 flow [2025-03-04 10:18:26,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:26,071 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 102 flow [2025-03-04 10:18:26,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2025-03-04 10:18:26,071 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-03-04 10:18:26,071 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 102 flow [2025-03-04 10:18:26,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-04 10:18:26,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:26,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:26,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:18:26,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:26,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:26,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:26,273 INFO L85 PathProgramCache]: Analyzing trace with hash 450534112, now seen corresponding path program 1 times [2025-03-04 10:18:26,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:26,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559696794] [2025-03-04 10:18:26,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:26,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:26,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:26,276 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:26,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:18:26,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:18:26,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:18:26,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:26,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:26,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:18:26,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:26,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:26,630 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:26,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559696794] [2025-03-04 10:18:26,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559696794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:26,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:26,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:26,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038897731] [2025-03-04 10:18:26,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:26,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:26,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:26,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:26,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:26,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-04 10:18:26,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-03-04 10:18:26,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:26,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-04 10:18:26,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:26,873 INFO L124 PetriNetUnfolderBase]: 870/1506 cut-off events. [2025-03-04 10:18:26,873 INFO L125 PetriNetUnfolderBase]: For 175/175 co-relation queries the response was YES. [2025-03-04 10:18:26,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3151 conditions, 1506 events. 870/1506 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6303 event pairs, 285 based on Foata normal form. 54/1491 useless extension candidates. Maximal degree in co-relation 3142. Up to 897 conditions per place. [2025-03-04 10:18:26,880 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 40 selfloop transitions, 3 changer transitions 2/52 dead transitions. [2025-03-04 10:18:26,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 52 transitions, 230 flow [2025-03-04 10:18:26,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-04 10:18:26,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-03-04 10:18:26,882 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 102 flow. Second operand 3 states and 83 transitions. [2025-03-04 10:18:26,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 52 transitions, 230 flow [2025-03-04 10:18:26,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:26,884 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 125 flow [2025-03-04 10:18:26,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-03-04 10:18:26,885 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2025-03-04 10:18:26,885 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 125 flow [2025-03-04 10:18:26,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-03-04 10:18:26,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:26,885 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] [2025-03-04 10:18:26,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:27,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:27,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:27,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:27,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1325802918, now seen corresponding path program 1 times [2025-03-04 10:18:27,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:27,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1673310808] [2025-03-04 10:18:27,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:27,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:27,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:27,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:27,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:18:27,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:18:27,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:18:27,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:27,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:27,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:18:27,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:27,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-04 10:18:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:27,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:27,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:27,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673310808] [2025-03-04 10:18:27,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673310808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:27,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:27,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:27,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165378211] [2025-03-04 10:18:27,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:27,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:27,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:27,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:27,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:27,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-04 10:18:27,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-03-04 10:18:27,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:27,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-04 10:18:27,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:27,573 INFO L124 PetriNetUnfolderBase]: 393/833 cut-off events. [2025-03-04 10:18:27,573 INFO L125 PetriNetUnfolderBase]: For 297/297 co-relation queries the response was YES. [2025-03-04 10:18:27,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 833 events. 393/833 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3432 event pairs, 134 based on Foata normal form. 64/892 useless extension candidates. Maximal degree in co-relation 1815. Up to 341 conditions per place. [2025-03-04 10:18:27,577 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 32 selfloop transitions, 8 changer transitions 0/50 dead transitions. [2025-03-04 10:18:27,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 247 flow [2025-03-04 10:18:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:27,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-04 10:18:27,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-03-04 10:18:27,578 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 125 flow. Second operand 3 states and 83 transitions. [2025-03-04 10:18:27,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 247 flow [2025-03-04 10:18:27,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:27,582 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 135 flow [2025-03-04 10:18:27,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-03-04 10:18:27,583 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2025-03-04 10:18:27,584 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 135 flow [2025-03-04 10:18:27,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-03-04 10:18:27,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:27,584 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] [2025-03-04 10:18:27,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:18:27,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:27,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:27,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash 976543792, now seen corresponding path program 2 times [2025-03-04 10:18:27,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:27,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2062975415] [2025-03-04 10:18:27,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:27,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:27,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:27,792 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:27,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:18:28,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:18:28,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:18:28,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:28,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:28,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:18:28,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:28,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:28,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:28,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062975415] [2025-03-04 10:18:28,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062975415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:28,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:28,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:18:28,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977145445] [2025-03-04 10:18:28,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:28,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:28,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:28,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:28,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:28,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-04 10:18:28,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:28,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:28,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-04 10:18:28,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:28,504 INFO L124 PetriNetUnfolderBase]: 512/1090 cut-off events. [2025-03-04 10:18:28,505 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-03-04 10:18:28,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 1090 events. 512/1090 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4716 event pairs, 35 based on Foata normal form. 15/1101 useless extension candidates. Maximal degree in co-relation 2640. Up to 244 conditions per place. [2025-03-04 10:18:28,510 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 77 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2025-03-04 10:18:28,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 93 transitions, 497 flow [2025-03-04 10:18:28,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:18:28,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:18:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2025-03-04 10:18:28,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6550387596899225 [2025-03-04 10:18:28,512 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 135 flow. Second operand 6 states and 169 transitions. [2025-03-04 10:18:28,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 93 transitions, 497 flow [2025-03-04 10:18:28,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 93 transitions, 462 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:28,514 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 154 flow [2025-03-04 10:18:28,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2025-03-04 10:18:28,515 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-03-04 10:18:28,515 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 154 flow [2025-03-04 10:18:28,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:28,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:28,516 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:28,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:28,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:28,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:28,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:28,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2016804846, now seen corresponding path program 3 times [2025-03-04 10:18:28,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:28,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [779295517] [2025-03-04 10:18:28,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:28,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:28,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:28,721 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:28,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:18:28,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:18:28,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 33 statements. [2025-03-04 10:18:28,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:18:28,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:28,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:18:28,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:18:29,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:29,003 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:29,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779295517] [2025-03-04 10:18:29,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779295517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:29,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:29,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:18:29,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038075801] [2025-03-04 10:18:29,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:29,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:29,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:29,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:29,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:29,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-04 10:18:29,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:29,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:29,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-04 10:18:29,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:29,307 INFO L124 PetriNetUnfolderBase]: 921/1892 cut-off events. [2025-03-04 10:18:29,307 INFO L125 PetriNetUnfolderBase]: For 1484/1485 co-relation queries the response was YES. [2025-03-04 10:18:29,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4667 conditions, 1892 events. 921/1892 cut-off events. For 1484/1485 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 10074 event pairs, 228 based on Foata normal form. 64/1913 useless extension candidates. Maximal degree in co-relation 4653. Up to 901 conditions per place. [2025-03-04 10:18:29,316 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 67 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2025-03-04 10:18:29,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 492 flow [2025-03-04 10:18:29,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-03-04 10:18:29,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.686046511627907 [2025-03-04 10:18:29,317 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 154 flow. Second operand 4 states and 118 transitions. [2025-03-04 10:18:29,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 492 flow [2025-03-04 10:18:29,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 80 transitions, 453 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:29,320 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 159 flow [2025-03-04 10:18:29,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2025-03-04 10:18:29,320 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2025-03-04 10:18:29,320 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 159 flow [2025-03-04 10:18:29,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:29,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:29,321 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:29,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:18:29,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:29,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:29,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:29,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2085129030, now seen corresponding path program 4 times [2025-03-04 10:18:29,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:29,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1624743398] [2025-03-04 10:18:29,526 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:29,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:29,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:29,528 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:29,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:18:29,792 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-04 10:18:29,803 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 39 statements. [2025-03-04 10:18:29,804 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:18:29,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:29,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:18:29,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:18:29,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:18:29,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:29,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624743398] [2025-03-04 10:18:29,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624743398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:29,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:18:29,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 10:18:29,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129456189] [2025-03-04 10:18:29,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:29,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:18:29,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:29,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:18:29,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:18:29,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:18:29,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 159 flow. Second operand has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 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-03-04 10:18:29,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:29,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:18:29,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:30,405 INFO L124 PetriNetUnfolderBase]: 1159/2275 cut-off events. [2025-03-04 10:18:30,406 INFO L125 PetriNetUnfolderBase]: For 1337/1345 co-relation queries the response was YES. [2025-03-04 10:18:30,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5821 conditions, 2275 events. 1159/2275 cut-off events. For 1337/1345 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 11828 event pairs, 121 based on Foata normal form. 29/2294 useless extension candidates. Maximal degree in co-relation 5807. Up to 490 conditions per place. [2025-03-04 10:18:30,416 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 92 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2025-03-04 10:18:30,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 107 transitions, 596 flow [2025-03-04 10:18:30,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:18:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:18:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2025-03-04 10:18:30,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2025-03-04 10:18:30,417 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 159 flow. Second operand 6 states and 168 transitions. [2025-03-04 10:18:30,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 107 transitions, 596 flow [2025-03-04 10:18:30,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 107 transitions, 596 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:18:30,421 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 181 flow [2025-03-04 10:18:30,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2025-03-04 10:18:30,422 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2025-03-04 10:18:30,422 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 181 flow [2025-03-04 10:18:30,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 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-03-04 10:18:30,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:30,422 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:30,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:18:30,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:30,627 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:30,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash 453429542, now seen corresponding path program 5 times [2025-03-04 10:18:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:30,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1453016633] [2025-03-04 10:18:30,628 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:18:30,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:30,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:30,629 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:30,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:18:30,913 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 4 equivalence classes. [2025-03-04 10:18:30,950 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:18:30,950 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:18:30,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:30,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:18:30,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:18:30,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:18:31,024 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:31,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453016633] [2025-03-04 10:18:31,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453016633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:31,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:18:31,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2025-03-04 10:18:31,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532010339] [2025-03-04 10:18:31,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:31,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:31,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:31,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:31,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:31,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-04 10:18:31,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-03-04 10:18:31,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:31,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-04 10:18:31,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:31,247 INFO L124 PetriNetUnfolderBase]: 605/1299 cut-off events. [2025-03-04 10:18:31,247 INFO L125 PetriNetUnfolderBase]: For 1482/1484 co-relation queries the response was YES. [2025-03-04 10:18:31,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3531 conditions, 1299 events. 605/1299 cut-off events. For 1482/1484 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5555 event pairs, 167 based on Foata normal form. 72/1365 useless extension candidates. Maximal degree in co-relation 3516. Up to 570 conditions per place. [2025-03-04 10:18:31,254 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 49 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2025-03-04 10:18:31,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 383 flow [2025-03-04 10:18:31,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-03-04 10:18:31,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563953488372093 [2025-03-04 10:18:31,256 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 181 flow. Second operand 4 states and 97 transitions. [2025-03-04 10:18:31,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 383 flow [2025-03-04 10:18:31,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 367 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:31,259 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 200 flow [2025-03-04 10:18:31,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2025-03-04 10:18:31,262 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2025-03-04 10:18:31,262 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 200 flow [2025-03-04 10:18:31,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-03-04 10:18:31,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:31,263 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:31,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:18:31,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:31,463 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:31,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:31,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1640451662, now seen corresponding path program 6 times [2025-03-04 10:18:31,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:31,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1171304124] [2025-03-04 10:18:31,464 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:18:31,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:31,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:31,466 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:31,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:18:31,739 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 2 equivalence classes. [2025-03-04 10:18:31,897 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:18:31,897 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:18:31,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:18:31,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:18:31,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:18:32,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:18:32,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:32,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:18:32,061 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 10:18:32,061 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:18:32,062 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-03-04 10:18:32,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-04 10:18:32,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-04 10:18:32,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-04 10:18:32,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:18:32,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:32,264 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2025-03-04 10:18:32,314 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:18:32,314 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:18:32,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:18:32 BasicIcfg [2025-03-04 10:18:32,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:18:32,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:18:32,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:18:32,318 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:18:32,319 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:24" (3/4) ... [2025-03-04 10:18:32,320 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 10:18:32,321 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:18:32,321 INFO L158 Benchmark]: Toolchain (without parser) took 9478.35ms. Allocated memory was 117.4MB in the beginning and 444.6MB in the end (delta: 327.2MB). Free memory was 91.2MB in the beginning and 294.5MB in the end (delta: -203.3MB). Peak memory consumption was 124.3MB. Max. memory is 16.1GB. [2025-03-04 10:18:32,321 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory is still 62.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:32,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.66ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 61.8MB in the end (delta: 29.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 10:18:32,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.53ms. Allocated memory is still 117.4MB. Free memory was 61.8MB in the beginning and 59.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:32,322 INFO L158 Benchmark]: Boogie Preprocessor took 62.47ms. Allocated memory is still 117.4MB. Free memory was 59.1MB in the beginning and 55.7MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:32,322 INFO L158 Benchmark]: IcfgBuilder took 1052.23ms. Allocated memory is still 117.4MB. Free memory was 55.4MB in the beginning and 33.2MB in the end (delta: 22.3MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2025-03-04 10:18:32,322 INFO L158 Benchmark]: TraceAbstraction took 7931.22ms. Allocated memory was 117.4MB in the beginning and 444.6MB in the end (delta: 327.2MB). Free memory was 32.3MB in the beginning and 294.5MB in the end (delta: -262.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 10:18:32,322 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 444.6MB. Free memory was 294.5MB in the beginning and 294.5MB in the end (delta: 27.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:32,323 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory is still 62.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.66ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 61.8MB in the end (delta: 29.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.53ms. Allocated memory is still 117.4MB. Free memory was 61.8MB in the beginning and 59.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.47ms. Allocated memory is still 117.4MB. Free memory was 59.1MB in the beginning and 55.7MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1052.23ms. Allocated memory is still 117.4MB. Free memory was 55.4MB in the beginning and 33.2MB in the end (delta: 22.3MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7931.22ms. Allocated memory was 117.4MB in the beginning and 444.6MB in the end (delta: 327.2MB). Free memory was 32.3MB in the beginning and 294.5MB in the end (delta: -262.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 444.6MB. Free memory was 294.5MB in the beginning and 294.5MB in the end (delta: 27.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=-1, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=-1, t2=0, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, t1=-1, t2=0, total=1] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-1, t2=0, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-1, t2=0, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) [L919] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] [L18] 0 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] - UnprovableResult [Line: 906]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 914]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.8s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 961 IncrementalHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 3 mSDtfsCounter, 961 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 295 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=8, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 272 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 711 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1592 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 57/81 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 10:18:32,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample