./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 29016034e4102bf62d4fcba069301a54da1d77dfd5739e4cf52e395ddaa22e38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:53:23,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:53:24,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:53:24,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:53:24,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:53:24,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:53:24,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:53:24,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:53:24,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:53:24,049 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:53:24,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:53:24,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:53:24,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:53:24,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:53:24,050 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:53:24,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:53:24,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:53:24,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:53:24,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:53:24,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:53:24,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:53:24,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:53:24,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:53:24,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:53:24,050 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:53:24,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:53:24,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:53:24,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:53:24,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:53:24,051 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 ! call(reach_error())) ) 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 -> 29016034e4102bf62d4fcba069301a54da1d77dfd5739e4cf52e395ddaa22e38 [2025-03-13 21:53:24,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:53:24,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:53:24,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:53:24,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:53:24,291 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:53:24,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i [2025-03-13 21:53:25,450 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a4d0e4a/ad83bb2a9cb44b538bfb81446e97fd50/FLAG3ab8bfada [2025-03-13 21:53:25,716 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:53:25,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i [2025-03-13 21:53:25,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a4d0e4a/ad83bb2a9cb44b538bfb81446e97fd50/FLAG3ab8bfada [2025-03-13 21:53:26,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a4d0e4a/ad83bb2a9cb44b538bfb81446e97fd50 [2025-03-13 21:53:26,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:53:26,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:53:26,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:53:26,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:53:26,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:53:26,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:53:26" (1/1) ... [2025-03-13 21:53:26,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@750c8ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26, skipping insertion in model container [2025-03-13 21:53:26,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:53:26" (1/1) ... [2025-03-13 21:53:26,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:53:26,327 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i[39757,39770] [2025-03-13 21:53:26,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:53:26,351 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:53:26,386 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i[39757,39770] [2025-03-13 21:53:26,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:53:26,436 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:53:26,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26 WrapperNode [2025-03-13 21:53:26,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:53:26,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:53:26,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:53:26,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:53:26,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26" (1/1) ... [2025-03-13 21:53:26,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26" (1/1) ... [2025-03-13 21:53:26,464 INFO L138 Inliner]: procedures = 243, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 260 [2025-03-13 21:53:26,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:53:26,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:53:26,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:53:26,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:53:26,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26" (1/1) ... [2025-03-13 21:53:26,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26" (1/1) ... [2025-03-13 21:53:26,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26" (1/1) ... [2025-03-13 21:53:26,485 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-13 21:53:26,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26" (1/1) ... [2025-03-13 21:53:26,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26" (1/1) ... [2025-03-13 21:53:26,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26" (1/1) ... [2025-03-13 21:53:26,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26" (1/1) ... [2025-03-13 21:53:26,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26" (1/1) ... [2025-03-13 21:53:26,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26" (1/1) ... [2025-03-13 21:53:26,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:53:26,497 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:53:26,497 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:53:26,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:53:26,499 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26" (1/1) ... [2025-03-13 21:53:26,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:53:26,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:26,524 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-13 21:53:26,529 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-13 21:53:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-13 21:53:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-13 21:53:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-13 21:53:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:53:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:53:26,542 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:53:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:53:26,542 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:53:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:53:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:53:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:53:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:53:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-13 21:53:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:53:26,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:53:26,543 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:53:26,659 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:53:26,660 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:53:26,932 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:53:26,933 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:53:26,933 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:53:28,834 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:53:28,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:53:28 BoogieIcfgContainer [2025-03-13 21:53:28,835 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:53:28,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:53:28,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:53:28,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:53:28,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:53:26" (1/3) ... [2025-03-13 21:53:28,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626f6ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:53:28, skipping insertion in model container [2025-03-13 21:53:28,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:26" (2/3) ... [2025-03-13 21:53:28,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626f6ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:53:28, skipping insertion in model container [2025-03-13 21:53:28,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:53:28" (3/3) ... [2025-03-13 21:53:28,842 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_ok.i [2025-03-13 21:53:28,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:53:28,857 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG arithmetic_prog_ok.i that has 3 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-13 21:53:28,859 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:53:28,907 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:53:28,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 90 flow [2025-03-13 21:53:28,980 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2025-03-13 21:53:28,982 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:53:28,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 36 events. 6/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-03-13 21:53:28,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 90 flow [2025-03-13 21:53:28,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 32 transitions, 76 flow [2025-03-13 21:53:28,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:53:29,003 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=LoopHeads, 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;@3594123b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:53:29,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:53:29,033 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:53:29,034 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-03-13 21:53:29,034 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:53:29,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:29,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:29,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:29,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:29,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1139875935, now seen corresponding path program 1 times [2025-03-13 21:53:29,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:29,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742968849] [2025-03-13 21:53:29,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:53:29,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:29,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:53:29,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:53:29,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:53:29,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:29,542 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-13 21:53:29,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:29,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742968849] [2025-03-13 21:53:29,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742968849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:53:29,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:53:29,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:53:29,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824423375] [2025-03-13 21:53:29,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:53:29,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:53:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:29,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:53:29,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:53:29,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-03-13 21:53:29,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-13 21:53:29,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:29,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-03-13 21:53:29,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:29,784 INFO L124 PetriNetUnfolderBase]: 414/749 cut-off events. [2025-03-13 21:53:29,784 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-13 21:53:29,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1424 conditions, 749 events. 414/749 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3327 event pairs, 160 based on Foata normal form. 17/754 useless extension candidates. Maximal degree in co-relation 1336. Up to 394 conditions per place. [2025-03-13 21:53:29,792 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 37 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2025-03-13 21:53:29,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 189 flow [2025-03-13 21:53:29,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:53:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:53:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-03-13 21:53:29,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6929824561403509 [2025-03-13 21:53:29,801 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 76 flow. Second operand 3 states and 79 transitions. [2025-03-13 21:53:29,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 189 flow [2025-03-13 21:53:29,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 48 transitions, 179 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:53:29,807 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 80 flow [2025-03-13 21:53:29,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2025-03-13 21:53:29,814 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-03-13 21:53:29,814 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 80 flow [2025-03-13 21:53:29,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-13 21:53:29,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:29,814 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-13 21:53:29,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:53:29,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:29,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:29,815 INFO L85 PathProgramCache]: Analyzing trace with hash 828176345, now seen corresponding path program 1 times [2025-03-13 21:53:29,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:29,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180836814] [2025-03-13 21:53:29,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:53:29,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:30,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:53:30,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:53:30,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:53:30,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:30,126 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-13 21:53:30,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:30,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180836814] [2025-03-13 21:53:30,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180836814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:53:30,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:53:30,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:53:30,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594933945] [2025-03-13 21:53:30,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:53:30,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:53:30,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:30,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:53:30,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:53:30,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-03-13 21:53:30,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 80 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-13 21:53:30,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:30,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-03-13 21:53:30,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:30,272 INFO L124 PetriNetUnfolderBase]: 735/1332 cut-off events. [2025-03-13 21:53:30,272 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-03-13 21:53:30,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 1332 events. 735/1332 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6887 event pairs, 295 based on Foata normal form. 30/1339 useless extension candidates. Maximal degree in co-relation 500. Up to 669 conditions per place. [2025-03-13 21:53:30,279 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 40 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-03-13 21:53:30,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 211 flow [2025-03-13 21:53:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:53:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:53:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-03-13 21:53:30,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7017543859649122 [2025-03-13 21:53:30,280 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 80 flow. Second operand 3 states and 80 transitions. [2025-03-13 21:53:30,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 211 flow [2025-03-13 21:53:30,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 51 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:53:30,281 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 90 flow [2025-03-13 21:53:30,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-03-13 21:53:30,282 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2025-03-13 21:53:30,282 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 90 flow [2025-03-13 21:53:30,282 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-13 21:53:30,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:30,282 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-13 21:53:30,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:53:30,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:30,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash 188298567, now seen corresponding path program 1 times [2025-03-13 21:53:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:30,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129001821] [2025-03-13 21:53:30,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:53:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:30,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:53:30,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:53:30,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:53:30,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:30,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:30,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129001821] [2025-03-13 21:53:30,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129001821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:30,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049530264] [2025-03-13 21:53:30,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:53:30,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:30,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:30,692 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-13 21:53:30,694 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-13 21:53:31,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:53:31,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:53:31,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:53:31,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:31,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:53:31,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:31,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:31,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049530264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:31,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:31,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-13 21:53:31,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157774408] [2025-03-13 21:53:31,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:31,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:53:31,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:31,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:53:31,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:53:31,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2025-03-13 21:53:31,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 90 flow. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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-13 21:53:31,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:31,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2025-03-13 21:53:31,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:32,053 INFO L124 PetriNetUnfolderBase]: 1533/2646 cut-off events. [2025-03-13 21:53:32,054 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2025-03-13 21:53:32,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5456 conditions, 2646 events. 1533/2646 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 13505 event pairs, 118 based on Foata normal form. 90/2724 useless extension candidates. Maximal degree in co-relation 2026. Up to 548 conditions per place. [2025-03-13 21:53:32,066 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 89 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2025-03-13 21:53:32,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 103 transitions, 458 flow [2025-03-13 21:53:32,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:53:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:53:32,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2025-03-13 21:53:32,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7236842105263158 [2025-03-13 21:53:32,069 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 90 flow. Second operand 6 states and 165 transitions. [2025-03-13 21:53:32,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 103 transitions, 458 flow [2025-03-13 21:53:32,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 103 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:53:32,072 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 128 flow [2025-03-13 21:53:32,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2025-03-13 21:53:32,073 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2025-03-13 21:53:32,073 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 128 flow [2025-03-13 21:53:32,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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-13 21:53:32,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:32,074 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:32,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:53:32,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:32,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:32,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:32,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1724257439, now seen corresponding path program 2 times [2025-03-13 21:53:32,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:32,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813005091] [2025-03-13 21:53:32,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:53:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:32,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-13 21:53:32,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 21:53:32,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:53:32,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-13 21:53:32,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:32,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813005091] [2025-03-13 21:53:32,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813005091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:32,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311466096] [2025-03-13 21:53:32,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:53:32,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:32,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:32,519 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-13 21:53:32,520 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-13 21:53:33,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-13 21:53:33,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 21:53:33,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:53:33,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:33,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:53:33,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-13 21:53:33,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:53:33,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311466096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:53:33,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:53:33,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-13 21:53:33,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881546355] [2025-03-13 21:53:33,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:53:33,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:53:33,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:33,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:53:33,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:53:33,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-03-13 21:53:33,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-13 21:53:33,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:33,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-03-13 21:53:33,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:33,579 INFO L124 PetriNetUnfolderBase]: 1854/3262 cut-off events. [2025-03-13 21:53:33,579 INFO L125 PetriNetUnfolderBase]: For 1062/1062 co-relation queries the response was YES. [2025-03-13 21:53:33,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7249 conditions, 3262 events. 1854/3262 cut-off events. For 1062/1062 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 15759 event pairs, 445 based on Foata normal form. 0/3055 useless extension candidates. Maximal degree in co-relation 5313. Up to 1593 conditions per place. [2025-03-13 21:53:33,593 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 49 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2025-03-13 21:53:33,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 324 flow [2025-03-13 21:53:33,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:53:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:53:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-13 21:53:33,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5986842105263158 [2025-03-13 21:53:33,595 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 128 flow. Second operand 4 states and 91 transitions. [2025-03-13 21:53:33,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 324 flow [2025-03-13 21:53:33,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 309 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:53:33,599 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 145 flow [2025-03-13 21:53:33,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2025-03-13 21:53:33,599 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2025-03-13 21:53:33,600 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 145 flow [2025-03-13 21:53:33,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-13 21:53:33,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:33,600 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:33,610 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-13 21:53:33,800 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,SelfDestructingSolverStorable3 [2025-03-13 21:53:33,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:33,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:33,801 INFO L85 PathProgramCache]: Analyzing trace with hash 694047995, now seen corresponding path program 3 times [2025-03-13 21:53:33,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:33,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075502776] [2025-03-13 21:53:33,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:53:33,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:33,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 4 equivalence classes. [2025-03-13 21:53:33,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 56 statements. [2025-03-13 21:53:33,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-13 21:53:33,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-13 21:53:34,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:34,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075502776] [2025-03-13 21:53:34,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075502776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:53:34,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:53:34,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:53:34,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241648016] [2025-03-13 21:53:34,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:53:34,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:53:34,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:34,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:53:34,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:53:34,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-03-13 21:53:34,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-13 21:53:34,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:34,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-03-13 21:53:34,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:34,257 INFO L124 PetriNetUnfolderBase]: 777/1670 cut-off events. [2025-03-13 21:53:34,257 INFO L125 PetriNetUnfolderBase]: For 959/959 co-relation queries the response was YES. [2025-03-13 21:53:34,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4024 conditions, 1670 events. 777/1670 cut-off events. For 959/959 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7753 event pairs, 214 based on Foata normal form. 126/1795 useless extension candidates. Maximal degree in co-relation 2856. Up to 595 conditions per place. [2025-03-13 21:53:34,264 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 42 selfloop transitions, 15 changer transitions 0/67 dead transitions. [2025-03-13 21:53:34,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 386 flow [2025-03-13 21:53:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:53:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:53:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-03-13 21:53:34,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5473684210526316 [2025-03-13 21:53:34,266 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 145 flow. Second operand 5 states and 104 transitions. [2025-03-13 21:53:34,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 386 flow [2025-03-13 21:53:34,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:53:34,269 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 186 flow [2025-03-13 21:53:34,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-03-13 21:53:34,269 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2025-03-13 21:53:34,269 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 186 flow [2025-03-13 21:53:34,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-13 21:53:34,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:34,270 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:34,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:53:34,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:34,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1404627235, now seen corresponding path program 4 times [2025-03-13 21:53:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:34,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927104476] [2025-03-13 21:53:34,271 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:53:34,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:34,418 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-13 21:53:34,424 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-03-13 21:53:34,424 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:53:34,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:53:34,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:34,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927104476] [2025-03-13 21:53:34,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927104476] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:34,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776372506] [2025-03-13 21:53:34,486 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:53:34,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:34,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:34,488 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-13 21:53:34,490 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-13 21:53:35,229 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-13 21:53:35,247 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-03-13 21:53:35,248 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:53:35,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:35,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-13 21:53:35,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:35,310 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:53:35,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:53:35,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776372506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:35,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:35,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-03-13 21:53:35,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713381520] [2025-03-13 21:53:35,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:35,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:53:35,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:35,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:53:35,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:53:35,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2025-03-13 21:53:35,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 186 flow. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:53:35,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:35,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2025-03-13 21:53:35,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:35,671 INFO L124 PetriNetUnfolderBase]: 1854/3711 cut-off events. [2025-03-13 21:53:35,671 INFO L125 PetriNetUnfolderBase]: For 2610/2626 co-relation queries the response was YES. [2025-03-13 21:53:35,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10100 conditions, 3711 events. 1854/3711 cut-off events. For 2610/2626 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 21038 event pairs, 179 based on Foata normal form. 207/3912 useless extension candidates. Maximal degree in co-relation 7945. Up to 1072 conditions per place. [2025-03-13 21:53:35,687 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 97 selfloop transitions, 6 changer transitions 0/113 dead transitions. [2025-03-13 21:53:35,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 113 transitions, 710 flow [2025-03-13 21:53:35,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:53:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:53:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2025-03-13 21:53:35,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885964912280702 [2025-03-13 21:53:35,691 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 186 flow. Second operand 6 states and 157 transitions. [2025-03-13 21:53:35,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 113 transitions, 710 flow [2025-03-13 21:53:35,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 113 transitions, 710 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:53:35,697 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 232 flow [2025-03-13 21:53:35,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2025-03-13 21:53:35,698 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2025-03-13 21:53:35,699 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 232 flow [2025-03-13 21:53:35,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:53:35,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:35,699 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:35,709 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-13 21:53:35,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:35,900 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:35,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:35,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1978039941, now seen corresponding path program 5 times [2025-03-13 21:53:35,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:35,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020024399] [2025-03-13 21:53:35,900 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:53:35,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:36,037 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 62 statements into 6 equivalence classes. [2025-03-13 21:53:36,051 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 21:53:36,051 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-13 21:53:36,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-13 21:53:36,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:36,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020024399] [2025-03-13 21:53:36,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020024399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:36,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102044465] [2025-03-13 21:53:36,229 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:53:36,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:36,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:36,232 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-13 21:53:36,234 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-13 21:53:36,993 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 62 statements into 6 equivalence classes. [2025-03-13 21:53:37,033 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 21:53:37,033 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-13 21:53:37,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:37,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-13 21:53:37,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-13 21:53:37,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-13 21:53:37,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102044465] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:37,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:37,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2025-03-13 21:53:37,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032439474] [2025-03-13 21:53:37,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:37,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:53:37,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:37,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:53:37,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:53:37,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-03-13 21:53:37,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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-13 21:53:37,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:37,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-03-13 21:53:37,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:37,255 INFO L124 PetriNetUnfolderBase]: 544/1202 cut-off events. [2025-03-13 21:53:37,255 INFO L125 PetriNetUnfolderBase]: For 1587/1589 co-relation queries the response was YES. [2025-03-13 21:53:37,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3691 conditions, 1202 events. 544/1202 cut-off events. For 1587/1589 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4899 event pairs, 151 based on Foata normal form. 0/1200 useless extension candidates. Maximal degree in co-relation 2032. Up to 530 conditions per place. [2025-03-13 21:53:37,261 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 53 selfloop transitions, 3 changer transitions 3/68 dead transitions. [2025-03-13 21:53:37,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 68 transitions, 473 flow [2025-03-13 21:53:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:53:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:53:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-03-13 21:53:37,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5592105263157895 [2025-03-13 21:53:37,262 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 232 flow. Second operand 4 states and 85 transitions. [2025-03-13 21:53:37,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 68 transitions, 473 flow [2025-03-13 21:53:37,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 457 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:53:37,265 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 216 flow [2025-03-13 21:53:37,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2025-03-13 21:53:37,266 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 27 predicate places. [2025-03-13 21:53:37,266 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 216 flow [2025-03-13 21:53:37,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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-13 21:53:37,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:37,266 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:37,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:53:37,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:37,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:37,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash -361909783, now seen corresponding path program 6 times [2025-03-13 21:53:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:37,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793116913] [2025-03-13 21:53:37,472 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:53:37,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:37,700 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 3 equivalence classes. [2025-03-13 21:53:37,739 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 21:53:37,739 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-13 21:53:37,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:38,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:38,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793116913] [2025-03-13 21:53:38,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793116913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:38,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360519918] [2025-03-13 21:53:38,092 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:53:38,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:38,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:38,095 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-13 21:53:38,096 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-13 21:53:38,863 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 3 equivalence classes. [2025-03-13 21:53:38,918 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 21:53:38,918 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-13 21:53:38,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:38,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-13 21:53:38,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:39,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:39,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360519918] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:39,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:39,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 29 [2025-03-13 21:53:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268901953] [2025-03-13 21:53:39,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:39,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-13 21:53:39,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:39,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-13 21:53:39,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2025-03-13 21:53:39,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-13 21:53:39,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 216 flow. Second operand has 30 states, 30 states have (on average 14.2) internal successors, (426), 30 states have internal predecessors, (426), 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-13 21:53:39,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:39,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-13 21:53:39,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:40,719 INFO L124 PetriNetUnfolderBase]: 585/1253 cut-off events. [2025-03-13 21:53:40,719 INFO L125 PetriNetUnfolderBase]: For 1567/1567 co-relation queries the response was YES. [2025-03-13 21:53:40,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3818 conditions, 1253 events. 585/1253 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5105 event pairs, 35 based on Foata normal form. 30/1279 useless extension candidates. Maximal degree in co-relation 2328. Up to 240 conditions per place. [2025-03-13 21:53:40,723 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 0 selfloop transitions, 0 changer transitions 130/130 dead transitions. [2025-03-13 21:53:40,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 130 transitions, 884 flow [2025-03-13 21:53:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:53:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:53:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 238 transitions. [2025-03-13 21:53:40,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5219298245614035 [2025-03-13 21:53:40,725 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 216 flow. Second operand 12 states and 238 transitions. [2025-03-13 21:53:40,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 130 transitions, 884 flow [2025-03-13 21:53:40,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 130 transitions, 852 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:53:40,729 INFO L231 Difference]: Finished difference. Result has 67 places, 0 transitions, 0 flow [2025-03-13 21:53:40,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=67, PETRI_TRANSITIONS=0} [2025-03-13 21:53:40,729 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2025-03-13 21:53:40,729 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 0 transitions, 0 flow [2025-03-13 21:53:40,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 14.2) internal successors, (426), 30 states have internal predecessors, (426), 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-13 21:53:40,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-13 21:53:40,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-13 21:53:40,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-13 21:53:40,741 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-13 21:53:40,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:40,933 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2025-03-13 21:53:40,935 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:53:40,935 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:53:40,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:53:40 BasicIcfg [2025-03-13 21:53:40,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:53:40,939 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:53:40,939 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:53:40,939 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:53:40,939 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:53:28" (3/4) ... [2025-03-13 21:53:40,941 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 21:53:40,943 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 21:53:40,944 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 21:53:40,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 256 nodes and edges [2025-03-13 21:53:40,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-13 21:53:40,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-13 21:53:40,952 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-13 21:53:40,952 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 21:53:41,018 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:53:41,018 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:53:41,018 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:53:41,019 INFO L158 Benchmark]: Toolchain (without parser) took 15008.14ms. Allocated memory was 201.3MB in the beginning and 788.5MB in the end (delta: 587.2MB). Free memory was 153.4MB in the beginning and 511.8MB in the end (delta: -358.5MB). Peak memory consumption was 225.0MB. Max. memory is 16.1GB. [2025-03-13 21:53:41,021 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:53:41,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.90ms. Allocated memory is still 201.3MB. Free memory was 153.4MB in the beginning and 125.5MB in the end (delta: 27.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 21:53:41,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.25ms. Allocated memory is still 201.3MB. Free memory was 125.5MB in the beginning and 122.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:53:41,021 INFO L158 Benchmark]: Boogie Preprocessor took 31.60ms. Allocated memory is still 201.3MB. Free memory was 122.7MB in the beginning and 119.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:53:41,021 INFO L158 Benchmark]: IcfgBuilder took 2337.89ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 119.7MB in the beginning and 153.0MB in the end (delta: -33.3MB). Peak memory consumption was 129.1MB. Max. memory is 16.1GB. [2025-03-13 21:53:41,022 INFO L158 Benchmark]: TraceAbstraction took 12101.97ms. Allocated memory was 352.3MB in the beginning and 788.5MB in the end (delta: 436.2MB). Free memory was 153.0MB in the beginning and 520.2MB in the end (delta: -367.3MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2025-03-13 21:53:41,022 INFO L158 Benchmark]: Witness Printer took 79.99ms. Allocated memory is still 788.5MB. Free memory was 520.2MB in the beginning and 511.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:53:41,024 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.19ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.90ms. Allocated memory is still 201.3MB. Free memory was 153.4MB in the beginning and 125.5MB in the end (delta: 27.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.25ms. Allocated memory is still 201.3MB. Free memory was 125.5MB in the beginning and 122.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.60ms. Allocated memory is still 201.3MB. Free memory was 122.7MB in the beginning and 119.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 2337.89ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 119.7MB in the beginning and 153.0MB in the end (delta: -33.3MB). Peak memory consumption was 129.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12101.97ms. Allocated memory was 352.3MB in the beginning and 788.5MB in the end (delta: 436.2MB). Free memory was 153.0MB in the beginning and 520.2MB in the end (delta: -367.3MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. * Witness Printer took 79.99ms. Allocated memory is still 788.5MB. Free memory was 520.2MB in the beginning and 511.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 919]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 3 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: 12.0s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 423 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 410 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3025 IncrementalHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 2 mSDtfsCounter, 3025 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 439 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=6, InterpolantAutomatonStates: 43, 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, 2.0s InterpolantComputationTime, 590 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 779 ConstructedInterpolants, 0 QuantifiedInterpolants, 2601 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2149 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 229/512 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 21:53:41,041 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: TRUE