./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.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 6883737711af32a6a824eca7af237353e2fdaf7712a6b3c22083c0d47b565ee7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:27:17,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:27:17,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:27:17,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:27:17,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:27:17,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:27:17,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:27:17,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:27:17,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:27:17,675 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:27:17,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:27:17,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:27:17,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:27:17,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:27:17,676 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:27:17,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:27:17,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:27:17,677 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:27:17,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:27:17,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:27:17,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:27:17,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:27:17,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:27:17,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:27:17,677 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:27:17,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:27:17,678 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:27:17,678 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:27:17,678 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:27:17,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:27:17,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:27:17,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:27:17,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:27:17,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:27:17,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:27:17,679 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:27:17,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:27:17,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:27:17,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:27:17,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:27:17,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:27:17,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:27:17,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:27:17,679 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 -> 6883737711af32a6a824eca7af237353e2fdaf7712a6b3c22083c0d47b565ee7 [2025-03-08 17:27:17,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:27:17,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:27:17,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:27:17,905 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:27:17,906 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:27:17,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-08 17:27:19,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bacd8ae8f/f881d1c9ffb241fd83f2173c75b70d3c/FLAG33b25a0c7 [2025-03-08 17:27:19,333 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:27:19,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-08 17:27:19,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bacd8ae8f/f881d1c9ffb241fd83f2173c75b70d3c/FLAG33b25a0c7 [2025-03-08 17:27:19,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bacd8ae8f/f881d1c9ffb241fd83f2173c75b70d3c [2025-03-08 17:27:19,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:27:19,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:27:19,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:27:19,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:27:19,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:27:19,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:27:19" (1/1) ... [2025-03-08 17:27:19,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab1b04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:19, skipping insertion in model container [2025-03-08 17:27:19,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:27:19" (1/1) ... [2025-03-08 17:27:19,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:27:19,799 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/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2025-03-08 17:27:19,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:27:19,965 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:27:19,973 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/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2025-03-08 17:27:20,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:27:20,025 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:27:20,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20 WrapperNode [2025-03-08 17:27:20,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:27:20,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:27:20,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:27:20,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:27:20,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 17:27:20,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 17:27:20,050 INFO L138 Inliner]: procedures = 165, calls = 46, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 162 [2025-03-08 17:27:20,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:27:20,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:27:20,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:27:20,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:27:20,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 17:27:20,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 17:27:20,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 17:27:20,074 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 17:27:20,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 17:27:20,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 17:27:20,078 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 17:27:20,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 17:27:20,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 17:27:20,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 17:27:20,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:27:20,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:27:20,084 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:27:20,084 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:27:20,084 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (1/1) ... [2025-03-08 17:27:20,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:27:20,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:27:20,107 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-08 17:27:20,109 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-08 17:27:20,122 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 17:27:20,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:27:20,122 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 17:27:20,122 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 17:27:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:27:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:27:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 17:27:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 17:27:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 17:27:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:27:20,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:27:20,124 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:27:20,206 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:27:20,207 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:27:20,413 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:27:20,413 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:27:20,586 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:27:20,586 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:27:20,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:27:20 BoogieIcfgContainer [2025-03-08 17:27:20,587 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:27:20,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:27:20,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:27:20,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:27:20,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:27:19" (1/3) ... [2025-03-08 17:27:20,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dffb96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:27:20, skipping insertion in model container [2025-03-08 17:27:20,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:20" (2/3) ... [2025-03-08 17:27:20,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dffb96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:27:20, skipping insertion in model container [2025-03-08 17:27:20,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:27:20" (3/3) ... [2025-03-08 17:27:20,595 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-08 17:27:20,605 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:27:20,606 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i that has 2 procedures, 50 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-08 17:27:20,606 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:27:20,645 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:27:20,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 54 transitions, 112 flow [2025-03-08 17:27:20,711 INFO L124 PetriNetUnfolderBase]: 4/54 cut-off events. [2025-03-08 17:27:20,712 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:27:20,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 54 events. 4/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-03-08 17:27:20,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 54 transitions, 112 flow [2025-03-08 17:27:20,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 43 transitions, 89 flow [2025-03-08 17:27:20,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:27:20,739 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;@6d1b32e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:27:20,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-08 17:27:20,746 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:27:20,746 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2025-03-08 17:27:20,746 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:27:20,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:27:20,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:27:20,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:27:20,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:27:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1632736175, now seen corresponding path program 1 times [2025-03-08 17:27:20,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:27:20,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499794235] [2025-03-08 17:27:20,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:20,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:27:20,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 17:27:20,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:27:20,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:20,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:21,118 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-08 17:27:21,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:27:21,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499794235] [2025-03-08 17:27:21,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499794235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:27:21,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:27:21,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:27:21,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308236800] [2025-03-08 17:27:21,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:27:21,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:27:21,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:27:21,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:27:21,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:27:21,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-03-08 17:27:21,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:27:21,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:27:21,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-03-08 17:27:21,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:27:21,361 INFO L124 PetriNetUnfolderBase]: 202/488 cut-off events. [2025-03-08 17:27:21,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:27:21,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 488 events. 202/488 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2188 event pairs, 47 based on Foata normal form. 41/499 useless extension candidates. Maximal degree in co-relation 918. Up to 252 conditions per place. [2025-03-08 17:27:21,369 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 44 selfloop transitions, 7 changer transitions 8/67 dead transitions. [2025-03-08 17:27:21,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 67 transitions, 255 flow [2025-03-08 17:27:21,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:27:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:27:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-03-08 17:27:21,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2025-03-08 17:27:21,407 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 89 flow. Second operand 5 states and 136 transitions. [2025-03-08 17:27:21,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 67 transitions, 255 flow [2025-03-08 17:27:21,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:27:21,412 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 116 flow [2025-03-08 17:27:21,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2025-03-08 17:27:21,419 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2025-03-08 17:27:21,419 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 116 flow [2025-03-08 17:27:21,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:27:21,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:27:21,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:27:21,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:27:21,420 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:27:21,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:27:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1867425931, now seen corresponding path program 1 times [2025-03-08 17:27:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:27:21,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299292113] [2025-03-08 17:27:21,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:21,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:27:21,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:27:21,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:27:21,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:21,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:21,578 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-08 17:27:21,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:27:21,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299292113] [2025-03-08 17:27:21,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299292113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:27:21,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:27:21,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:27:21,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970626035] [2025-03-08 17:27:21,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:27:21,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:27:21,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:27:21,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:27:21,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:27:21,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2025-03-08 17:27:21,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:27:21,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:27:21,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2025-03-08 17:27:21,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:27:21,813 INFO L124 PetriNetUnfolderBase]: 171/435 cut-off events. [2025-03-08 17:27:21,814 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-08 17:27:21,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 435 events. 171/435 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1940 event pairs, 69 based on Foata normal form. 15/446 useless extension candidates. Maximal degree in co-relation 962. Up to 204 conditions per place. [2025-03-08 17:27:21,818 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 36 selfloop transitions, 4 changer transitions 38/86 dead transitions. [2025-03-08 17:27:21,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 86 transitions, 380 flow [2025-03-08 17:27:21,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:27:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:27:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-03-08 17:27:21,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2025-03-08 17:27:21,821 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 116 flow. Second operand 8 states and 183 transitions. [2025-03-08 17:27:21,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 86 transitions, 380 flow [2025-03-08 17:27:21,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 86 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:27:21,823 INFO L231 Difference]: Finished difference. Result has 57 places, 35 transitions, 110 flow [2025-03-08 17:27:21,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=110, PETRI_PLACES=57, PETRI_TRANSITIONS=35} [2025-03-08 17:27:21,826 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2025-03-08 17:27:21,826 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 35 transitions, 110 flow [2025-03-08 17:27:21,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:27:21,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:27:21,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:27:21,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:27:21,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:27:21,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:27:21,828 INFO L85 PathProgramCache]: Analyzing trace with hash -305332809, now seen corresponding path program 1 times [2025-03-08 17:27:21,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:27:21,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968121297] [2025-03-08 17:27:21,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:21,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:27:21,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 17:27:21,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 17:27:21,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:21,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:21,926 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-08 17:27:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:27:21,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968121297] [2025-03-08 17:27:21,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968121297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:27:21,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:27:21,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:27:21,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897809969] [2025-03-08 17:27:21,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:27:21,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:27:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:27:21,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:27:21,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:27:21,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-03-08 17:27:21,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 35 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-08 17:27:21,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:27:21,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-03-08 17:27:21,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:27:22,041 INFO L124 PetriNetUnfolderBase]: 116/298 cut-off events. [2025-03-08 17:27:22,041 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2025-03-08 17:27:22,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 298 events. 116/298 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1186 event pairs, 55 based on Foata normal form. 11/307 useless extension candidates. Maximal degree in co-relation 725. Up to 178 conditions per place. [2025-03-08 17:27:22,045 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 40 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2025-03-08 17:27:22,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 272 flow [2025-03-08 17:27:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:27:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:27:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-03-08 17:27:22,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2025-03-08 17:27:22,046 INFO L175 Difference]: Start difference. First operand has 57 places, 35 transitions, 110 flow. Second operand 5 states and 119 transitions. [2025-03-08 17:27:22,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 272 flow [2025-03-08 17:27:22,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 212 flow, removed 10 selfloop flow, removed 13 redundant places. [2025-03-08 17:27:22,048 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 122 flow [2025-03-08 17:27:22,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2025-03-08 17:27:22,049 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-03-08 17:27:22,049 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 122 flow [2025-03-08 17:27:22,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-08 17:27:22,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:27:22,049 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-08 17:27:22,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:27:22,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:27:22,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:27:22,050 INFO L85 PathProgramCache]: Analyzing trace with hash -631798837, now seen corresponding path program 1 times [2025-03-08 17:27:22,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:27:22,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057503138] [2025-03-08 17:27:22,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:22,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:27:22,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 17:27:22,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 17:27:22,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:22,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:22,121 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-08 17:27:22,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:27:22,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057503138] [2025-03-08 17:27:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057503138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:27:22,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:27:22,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:27:22,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449806614] [2025-03-08 17:27:22,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:27:22,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:27:22,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:27:22,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:27:22,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:27:22,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-03-08 17:27:22,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-08 17:27:22,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:27:22,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-03-08 17:27:22,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:27:22,223 INFO L124 PetriNetUnfolderBase]: 109/277 cut-off events. [2025-03-08 17:27:22,223 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-08 17:27:22,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 277 events. 109/277 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1034 event pairs, 41 based on Foata normal form. 8/283 useless extension candidates. Maximal degree in co-relation 622. Up to 146 conditions per place. [2025-03-08 17:27:22,225 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 39 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2025-03-08 17:27:22,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 264 flow [2025-03-08 17:27:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:27:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:27:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2025-03-08 17:27:22,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.404320987654321 [2025-03-08 17:27:22,226 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 122 flow. Second operand 6 states and 131 transitions. [2025-03-08 17:27:22,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 264 flow [2025-03-08 17:27:22,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 254 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-08 17:27:22,228 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 139 flow [2025-03-08 17:27:22,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-03-08 17:27:22,229 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2025-03-08 17:27:22,229 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 139 flow [2025-03-08 17:27:22,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-08 17:27:22,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:27:22,229 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-08 17:27:22,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:27:22,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:27:22,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:27:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash 566019547, now seen corresponding path program 1 times [2025-03-08 17:27:22,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:27:22,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78794410] [2025-03-08 17:27:22,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:27:22,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 17:27:22,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 17:27:22,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:22,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:22,359 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-08 17:27:22,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:27:22,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78794410] [2025-03-08 17:27:22,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78794410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:27:22,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:27:22,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:27:22,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029497643] [2025-03-08 17:27:22,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:27:22,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:27:22,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:27:22,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:27:22,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:27:22,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2025-03-08 17:27:22,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-08 17:27:22,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:27:22,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2025-03-08 17:27:22,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:27:22,439 INFO L124 PetriNetUnfolderBase]: 67/209 cut-off events. [2025-03-08 17:27:22,439 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-08 17:27:22,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 209 events. 67/209 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 750 event pairs, 22 based on Foata normal form. 10/217 useless extension candidates. Maximal degree in co-relation 474. Up to 90 conditions per place. [2025-03-08 17:27:22,440 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 37 selfloop transitions, 7 changer transitions 2/56 dead transitions. [2025-03-08 17:27:22,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 287 flow [2025-03-08 17:27:22,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:27:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:27:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-03-08 17:27:22,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5601851851851852 [2025-03-08 17:27:22,442 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 139 flow. Second operand 4 states and 121 transitions. [2025-03-08 17:27:22,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 287 flow [2025-03-08 17:27:22,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 278 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-08 17:27:22,443 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 154 flow [2025-03-08 17:27:22,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-03-08 17:27:22,444 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2025-03-08 17:27:22,444 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 154 flow [2025-03-08 17:27:22,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-08 17:27:22,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:27:22,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:27:22,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:27:22,445 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:27:22,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:27:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1709383193, now seen corresponding path program 1 times [2025-03-08 17:27:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:27:22,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842841514] [2025-03-08 17:27:22,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:22,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:27:22,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 17:27:22,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 17:27:22,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:22,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:22,558 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-08 17:27:22,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:27:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842841514] [2025-03-08 17:27:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842841514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:27:22,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:27:22,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:27:22,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802231450] [2025-03-08 17:27:22,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:27:22,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:27:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:27:22,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:27:22,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:27:22,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2025-03-08 17:27:22,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-08 17:27:22,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:27:22,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2025-03-08 17:27:22,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:27:22,620 INFO L124 PetriNetUnfolderBase]: 66/215 cut-off events. [2025-03-08 17:27:22,620 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-08 17:27:22,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 215 events. 66/215 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 758 event pairs, 29 based on Foata normal form. 2/217 useless extension candidates. Maximal degree in co-relation 515. Up to 100 conditions per place. [2025-03-08 17:27:22,622 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 34 selfloop transitions, 5 changer transitions 3/51 dead transitions. [2025-03-08 17:27:22,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 275 flow [2025-03-08 17:27:22,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:27:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:27:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-08 17:27:22,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-03-08 17:27:22,623 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 154 flow. Second operand 4 states and 116 transitions. [2025-03-08 17:27:22,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 275 flow [2025-03-08 17:27:22,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:27:22,624 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 156 flow [2025-03-08 17:27:22,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2025-03-08 17:27:22,625 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2025-03-08 17:27:22,625 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 156 flow [2025-03-08 17:27:22,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-08 17:27:22,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:27:22,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:27:22,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:27:22,625 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:27:22,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:27:22,629 INFO L85 PathProgramCache]: Analyzing trace with hash -76951715, now seen corresponding path program 1 times [2025-03-08 17:27:22,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:27:22,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38001881] [2025-03-08 17:27:22,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:22,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:27:22,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 17:27:22,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 17:27:22,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:22,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:22,760 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-08 17:27:22,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:27:22,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38001881] [2025-03-08 17:27:22,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38001881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:27:22,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:27:22,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:27:22,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708031574] [2025-03-08 17:27:22,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:27:22,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:27:22,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:27:22,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:27:22,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:27:22,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-03-08 17:27:22,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-08 17:27:22,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:27:22,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-03-08 17:27:22,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:27:22,901 INFO L124 PetriNetUnfolderBase]: 74/206 cut-off events. [2025-03-08 17:27:22,901 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2025-03-08 17:27:22,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 206 events. 74/206 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 677 event pairs, 14 based on Foata normal form. 12/216 useless extension candidates. Maximal degree in co-relation 563. Up to 47 conditions per place. [2025-03-08 17:27:22,902 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 0 selfloop transitions, 0 changer transitions 58/58 dead transitions. [2025-03-08 17:27:22,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 338 flow [2025-03-08 17:27:22,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:27:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:27:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2025-03-08 17:27:22,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36213991769547327 [2025-03-08 17:27:22,903 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 156 flow. Second operand 9 states and 176 transitions. [2025-03-08 17:27:22,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 338 flow [2025-03-08 17:27:22,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 319 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 17:27:22,905 INFO L231 Difference]: Finished difference. Result has 54 places, 0 transitions, 0 flow [2025-03-08 17:27:22,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=54, PETRI_TRANSITIONS=0} [2025-03-08 17:27:22,905 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2025-03-08 17:27:22,905 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 0 transitions, 0 flow [2025-03-08 17:27:22,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-08 17:27:22,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-08 17:27:22,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-08 17:27:22,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-03-08 17:27:22,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-03-08 17:27:22,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-03-08 17:27:22,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-08 17:27:22,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-08 17:27:22,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:27:22,908 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:27:22,912 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 17:27:22,912 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:27:22,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:27:22 BasicIcfg [2025-03-08 17:27:22,918 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:27:22,918 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:27:22,918 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:27:22,919 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:27:22,919 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:27:20" (3/4) ... [2025-03-08 17:27:22,920 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 17:27:22,922 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-08 17:27:22,924 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2025-03-08 17:27:22,924 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-08 17:27:22,924 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-08 17:27:22,925 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 17:27:22,977 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 17:27:22,977 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 17:27:22,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:27:22,978 INFO L158 Benchmark]: Toolchain (without parser) took 3340.56ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 103.5MB in the beginning and 215.1MB in the end (delta: -111.6MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2025-03-08 17:27:22,978 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:27:22,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.48ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 82.4MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 17:27:22,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.09ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 80.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:27:22,978 INFO L158 Benchmark]: Boogie Preprocessor took 29.80ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 78.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:27:22,979 INFO L158 Benchmark]: IcfgBuilder took 503.59ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 101.7MB in the end (delta: -23.5MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2025-03-08 17:27:22,979 INFO L158 Benchmark]: TraceAbstraction took 2329.08ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 101.0MB in the beginning and 219.9MB in the end (delta: -118.9MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2025-03-08 17:27:22,979 INFO L158 Benchmark]: Witness Printer took 58.65ms. Allocated memory is still 327.2MB. Free memory was 219.9MB in the beginning and 215.1MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:27:22,980 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.48ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 82.4MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.09ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 80.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.80ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 78.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 503.59ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 101.7MB in the end (delta: -23.5MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2329.08ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 101.0MB in the beginning and 219.9MB in the end (delta: -118.9MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * Witness Printer took 58.65ms. Allocated memory is still 327.2MB. Free memory was 219.9MB in the beginning and 215.1MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 3 procedures, 79 locations, 86 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 342 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 723 IncrementalHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 12 mSDtfsCounter, 723 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 468 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 17:27:22,991 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