./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.unsafe_linked_list_fifo_n2d4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.unsafe_linked_list_fifo_n2d4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash eb904c0981d69b458d5d2831cb1cef4022d2f4fca573c75928a054243d001b7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:31:10,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:31:10,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 16:31:10,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:31:10,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:31:10,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:31:10,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:31:10,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:31:10,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:31:10,428 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:31:10,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:31:10,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:31:10,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:31:10,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:31:10,428 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:31:10,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:31:10,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:31:10,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:31:10,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:31:10,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:31:10,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:31:10,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:31:10,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:31:10,430 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb904c0981d69b458d5d2831cb1cef4022d2f4fca573c75928a054243d001b7a [2025-03-03 16:31:10,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:31:10,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:31:10,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:31:10,643 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:31:10,643 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:31:10,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.unsafe_linked_list_fifo_n2d4.c [2025-03-03 16:31:11,776 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0386d7b10/b0ca205c88c249c491fa336f4f7a54a4/FLAGfdd890ee0 [2025-03-03 16:31:12,081 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:31:12,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.unsafe_linked_list_fifo_n2d4.c [2025-03-03 16:31:12,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0386d7b10/b0ca205c88c249c491fa336f4f7a54a4/FLAGfdd890ee0 [2025-03-03 16:31:12,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0386d7b10/b0ca205c88c249c491fa336f4f7a54a4 [2025-03-03 16:31:12,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:31:12,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:31:12,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:31:12,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:31:12,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:31:12,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:31:12" (1/1) ... [2025-03-03 16:31:12,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc09894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12, skipping insertion in model container [2025-03-03 16:31:12,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:31:12" (1/1) ... [2025-03-03 16:31:12,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:31:12,282 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/hardware-verification-array/btor2c-lazyMod.unsafe_linked_list_fifo_n2d4.c[1268,1281] [2025-03-03 16:31:12,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:31:12,488 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:31:12,495 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/hardware-verification-array/btor2c-lazyMod.unsafe_linked_list_fifo_n2d4.c[1268,1281] [2025-03-03 16:31:12,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:31:12,616 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:31:12,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12 WrapperNode [2025-03-03 16:31:12,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:31:12,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:31:12,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:31:12,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:31:12,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12" (1/1) ... [2025-03-03 16:31:12,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12" (1/1) ... [2025-03-03 16:31:12,917 INFO L138 Inliner]: procedures = 18, calls = 107, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3678 [2025-03-03 16:31:12,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:31:12,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:31:12,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:31:12,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:31:12,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12" (1/1) ... [2025-03-03 16:31:12,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12" (1/1) ... [2025-03-03 16:31:12,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12" (1/1) ... [2025-03-03 16:31:13,116 INFO L175 MemorySlicer]: Split 63 memory accesses to 4 slices as follows [2, 29, 8, 24]. 46 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 30 writes are split as follows [0, 14, 4, 12]. [2025-03-03 16:31:13,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12" (1/1) ... [2025-03-03 16:31:13,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12" (1/1) ... [2025-03-03 16:31:13,210 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12" (1/1) ... [2025-03-03 16:31:13,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12" (1/1) ... [2025-03-03 16:31:13,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12" (1/1) ... [2025-03-03 16:31:13,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12" (1/1) ... [2025-03-03 16:31:13,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:31:13,356 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:31:13,356 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:31:13,357 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:31:13,357 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12" (1/1) ... [2025-03-03 16:31:13,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:31:13,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:13,414 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-03 16:31:13,422 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-03 16:31:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:31:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 16:31:13,441 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 16:31:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:31:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 16:31:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 16:31:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 16:31:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 16:31:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 16:31:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 16:31:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 16:31:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 16:31:13,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:31:13,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:31:13,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 16:31:13,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 16:31:13,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 16:31:13,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 16:31:13,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 16:31:13,692 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:31:13,694 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:31:15,772 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L144: call ULTIMATE.dealloc(main_~#state_13~0#1.base, main_~#state_13~0#1.offset);havoc main_~#state_13~0#1.base, main_~#state_13~0#1.offset;call ULTIMATE.dealloc(main_~#state_15~0#1.base, main_~#state_15~0#1.offset);havoc main_~#state_15~0#1.base, main_~#state_15~0#1.offset;call ULTIMATE.dealloc(main_~#state_249~0#1.base, main_~#state_249~0#1.offset);havoc main_~#state_249~0#1.base, main_~#state_249~0#1.offset; [2025-03-03 16:31:16,168 INFO L? ?]: Removed 1891 outVars from TransFormulas that were not future-live. [2025-03-03 16:31:16,168 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:31:16,257 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:31:16,258 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:31:16,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:31:16 BoogieIcfgContainer [2025-03-03 16:31:16,258 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:31:16,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:31:16,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:31:16,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:31:16,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:31:12" (1/3) ... [2025-03-03 16:31:16,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dafe27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:31:16, skipping insertion in model container [2025-03-03 16:31:16,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:31:12" (2/3) ... [2025-03-03 16:31:16,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dafe27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:31:16, skipping insertion in model container [2025-03-03 16:31:16,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:31:16" (3/3) ... [2025-03-03 16:31:16,268 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.unsafe_linked_list_fifo_n2d4.c [2025-03-03 16:31:16,284 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:31:16,286 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.unsafe_linked_list_fifo_n2d4.c that has 2 procedures, 1113 locations, 1 initial locations, 19 loop locations, and 1 error locations. [2025-03-03 16:31:16,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:31:16,350 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;@6254842d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:31:16,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 16:31:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 1113 states, 1105 states have (on average 1.5040723981900452) internal successors, (1662), 1106 states have internal predecessors, (1662), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:31:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-03 16:31:16,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:16,371 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:16,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:16,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:16,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1130841553, now seen corresponding path program 1 times [2025-03-03 16:31:16,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:16,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083207072] [2025-03-03 16:31:16,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:16,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-03 16:31:16,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-03 16:31:16,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:16,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 16:31:16,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:16,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083207072] [2025-03-03 16:31:16,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083207072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:16,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436397053] [2025-03-03 16:31:16,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:16,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:16,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:16,912 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-03 16:31:16,912 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-03 16:31:17,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-03 16:31:17,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-03 16:31:17,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:17,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:17,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 16:31:17,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 16:31:17,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:31:17,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436397053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:17,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:31:17,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 16:31:17,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561627570] [2025-03-03 16:31:17,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:17,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:31:17,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:17,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:31:17,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:31:17,585 INFO L87 Difference]: Start difference. First operand has 1113 states, 1105 states have (on average 1.5040723981900452) internal successors, (1662), 1106 states have internal predecessors, (1662), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:17,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:17,870 INFO L93 Difference]: Finished difference Result 1774 states and 2673 transitions. [2025-03-03 16:31:17,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:31:17,872 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 332 [2025-03-03 16:31:17,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:17,881 INFO L225 Difference]: With dead ends: 1774 [2025-03-03 16:31:17,881 INFO L226 Difference]: Without dead ends: 1110 [2025-03-03 16:31:17,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:31:17,888 INFO L435 NwaCegarLoop]: 1399 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:17,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1399 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:31:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-03-03 16:31:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2025-03-03 16:31:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1103 states have (on average 1.5022665457842248) internal successors, (1657), 1103 states have internal predecessors, (1657), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:31:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1667 transitions. [2025-03-03 16:31:17,969 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1667 transitions. Word has length 332 [2025-03-03 16:31:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:17,971 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1667 transitions. [2025-03-03 16:31:17,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1667 transitions. [2025-03-03 16:31:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-03 16:31:17,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:17,979 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:17,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:31:18,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 16:31:18,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:18,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1352756150, now seen corresponding path program 1 times [2025-03-03 16:31:18,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:18,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034727057] [2025-03-03 16:31:18,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:18,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:18,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-03 16:31:18,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-03 16:31:18,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:18,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:31:18,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:18,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034727057] [2025-03-03 16:31:18,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034727057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:18,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:31:18,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:31:18,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730756809] [2025-03-03 16:31:18,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:18,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:31:18,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:18,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:31:18,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:31:18,680 INFO L87 Difference]: Start difference. First operand 1110 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:19,041 INFO L93 Difference]: Finished difference Result 2218 states and 3332 transitions. [2025-03-03 16:31:19,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:31:19,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 332 [2025-03-03 16:31:19,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:19,045 INFO L225 Difference]: With dead ends: 2218 [2025-03-03 16:31:19,045 INFO L226 Difference]: Without dead ends: 1115 [2025-03-03 16:31:19,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:31:19,048 INFO L435 NwaCegarLoop]: 1397 mSDtfsCounter, 6 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:19,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2792 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:31:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-03 16:31:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1111. [2025-03-03 16:31:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1104 states have (on average 1.5018115942028984) internal successors, (1658), 1104 states have internal predecessors, (1658), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:31:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1668 transitions. [2025-03-03 16:31:19,071 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1668 transitions. Word has length 332 [2025-03-03 16:31:19,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:19,071 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1668 transitions. [2025-03-03 16:31:19,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1668 transitions. [2025-03-03 16:31:19,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-03 16:31:19,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:19,077 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:19,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:31:19,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:19,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:19,079 INFO L85 PathProgramCache]: Analyzing trace with hash 122763062, now seen corresponding path program 1 times [2025-03-03 16:31:19,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:19,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730055932] [2025-03-03 16:31:19,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:19,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:19,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-03 16:31:19,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-03 16:31:19,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:19,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:31:19,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:19,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730055932] [2025-03-03 16:31:19,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730055932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:19,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011147982] [2025-03-03 16:31:19,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:19,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:19,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:19,582 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-03 16:31:19,584 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-03 16:31:19,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-03 16:31:20,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-03 16:31:20,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:20,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:20,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 16:31:20,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:31:20,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:20,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011147982] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:20,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:20,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2025-03-03 16:31:20,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044282414] [2025-03-03 16:31:20,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:20,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:31:20,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:20,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:31:20,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:31:20,105 INFO L87 Difference]: Start difference. First operand 1111 states and 1668 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:20,446 INFO L93 Difference]: Finished difference Result 2037 states and 3059 transitions. [2025-03-03 16:31:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:31:20,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 335 [2025-03-03 16:31:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:20,450 INFO L225 Difference]: With dead ends: 2037 [2025-03-03 16:31:20,450 INFO L226 Difference]: Without dead ends: 1112 [2025-03-03 16:31:20,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:31:20,452 INFO L435 NwaCegarLoop]: 1397 mSDtfsCounter, 6 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:20,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2787 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:31:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-03-03 16:31:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1112. [2025-03-03 16:31:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 1105 states have (on average 1.5013574660633484) internal successors, (1659), 1105 states have internal predecessors, (1659), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:31:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1669 transitions. [2025-03-03 16:31:20,470 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1669 transitions. Word has length 335 [2025-03-03 16:31:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:20,471 INFO L471 AbstractCegarLoop]: Abstraction has 1112 states and 1669 transitions. [2025-03-03 16:31:20,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:20,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1669 transitions. [2025-03-03 16:31:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-03 16:31:20,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:20,474 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:20,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:20,678 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,SelfDestructingSolverStorable2 [2025-03-03 16:31:20,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:20,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1843538136, now seen corresponding path program 1 times [2025-03-03 16:31:20,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:20,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193905453] [2025-03-03 16:31:20,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:20,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:20,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 16:31:20,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 16:31:20,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:20,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:21,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:21,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193905453] [2025-03-03 16:31:21,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193905453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:21,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407448639] [2025-03-03 16:31:21,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:21,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:21,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:21,077 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-03 16:31:21,079 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-03 16:31:21,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 16:31:21,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 16:31:21,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:21,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:21,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:31:21,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:21,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:22,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407448639] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:31:22,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:31:22,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 8] total 12 [2025-03-03 16:31:22,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517292368] [2025-03-03 16:31:22,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:31:22,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 16:31:22,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:22,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 16:31:22,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:31:22,050 INFO L87 Difference]: Start difference. First operand 1112 states and 1669 transitions. Second operand has 12 states, 12 states have (on average 47.0) internal successors, (564), 12 states have internal predecessors, (564), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:31:24,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:24,672 INFO L93 Difference]: Finished difference Result 2625 states and 3941 transitions. [2025-03-03 16:31:24,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:31:24,673 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 47.0) internal successors, (564), 12 states have internal predecessors, (564), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 338 [2025-03-03 16:31:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:24,679 INFO L225 Difference]: With dead ends: 2625 [2025-03-03 16:31:24,679 INFO L226 Difference]: Without dead ends: 1521 [2025-03-03 16:31:24,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:31:24,681 INFO L435 NwaCegarLoop]: 1193 mSDtfsCounter, 2129 mSDsluCounter, 5595 mSDsCounter, 0 mSdLazyCounter, 5686 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2139 SdHoareTripleChecker+Valid, 6788 SdHoareTripleChecker+Invalid, 5689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:24,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2139 Valid, 6788 Invalid, 5689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5686 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 16:31:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-03-03 16:31:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1135. [2025-03-03 16:31:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1128 states have (on average 1.5) internal successors, (1692), 1128 states have internal predecessors, (1692), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:31:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1702 transitions. [2025-03-03 16:31:24,704 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1702 transitions. Word has length 338 [2025-03-03 16:31:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:24,704 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1702 transitions. [2025-03-03 16:31:24,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 47.0) internal successors, (564), 12 states have internal predecessors, (564), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:31:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1702 transitions. [2025-03-03 16:31:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-03 16:31:24,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:24,707 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:24,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 16:31:24,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:24,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:24,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:24,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1251526386, now seen corresponding path program 1 times [2025-03-03 16:31:24,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:24,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118029737] [2025-03-03 16:31:24,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:24,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:24,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 16:31:25,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 16:31:25,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:25,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:25,349 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:25,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:25,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118029737] [2025-03-03 16:31:25,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118029737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:25,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241769369] [2025-03-03 16:31:25,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:25,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:25,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:25,351 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-03 16:31:25,353 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-03 16:31:25,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 16:31:25,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 16:31:25,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:25,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:25,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 16:31:25,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:31:25,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 16:31:25,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241769369] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:31:25,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:31:25,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 9 [2025-03-03 16:31:25,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641035002] [2025-03-03 16:31:25,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:31:25,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:31:25,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:25,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:31:25,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:31:25,879 INFO L87 Difference]: Start difference. First operand 1135 states and 1702 transitions. Second operand has 9 states, 9 states have (on average 47.0) internal successors, (423), 9 states have internal predecessors, (423), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:31:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:26,573 INFO L93 Difference]: Finished difference Result 2281 states and 3424 transitions. [2025-03-03 16:31:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:31:26,574 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 47.0) internal successors, (423), 9 states have internal predecessors, (423), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 342 [2025-03-03 16:31:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:26,577 INFO L225 Difference]: With dead ends: 2281 [2025-03-03 16:31:26,577 INFO L226 Difference]: Without dead ends: 1159 [2025-03-03 16:31:26,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 680 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:31:26,579 INFO L435 NwaCegarLoop]: 1403 mSDtfsCounter, 48 mSDsluCounter, 6985 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8388 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:26,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 8388 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:31:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-03-03 16:31:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1155. [2025-03-03 16:31:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1148 states have (on average 1.4982578397212543) internal successors, (1720), 1148 states have internal predecessors, (1720), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:31:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1730 transitions. [2025-03-03 16:31:26,597 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1730 transitions. Word has length 342 [2025-03-03 16:31:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:26,597 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1730 transitions. [2025-03-03 16:31:26,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 47.0) internal successors, (423), 9 states have internal predecessors, (423), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:31:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1730 transitions. [2025-03-03 16:31:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-03 16:31:26,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:26,601 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:26,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 16:31:26,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:26,805 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:26,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:26,805 INFO L85 PathProgramCache]: Analyzing trace with hash -492422692, now seen corresponding path program 2 times [2025-03-03 16:31:26,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:26,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101066986] [2025-03-03 16:31:26,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:31:26,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:26,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 354 statements into 2 equivalence classes. [2025-03-03 16:31:26,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 279 of 354 statements. [2025-03-03 16:31:26,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 16:31:26,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 16:31:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:27,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101066986] [2025-03-03 16:31:27,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101066986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:27,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:31:27,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:31:27,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945549938] [2025-03-03 16:31:27,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:27,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:31:27,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:27,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:31:27,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:31:27,034 INFO L87 Difference]: Start difference. First operand 1155 states and 1730 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:27,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:27,346 INFO L93 Difference]: Finished difference Result 2292 states and 3435 transitions. [2025-03-03 16:31:27,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:31:27,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 354 [2025-03-03 16:31:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:27,349 INFO L225 Difference]: With dead ends: 2292 [2025-03-03 16:31:27,349 INFO L226 Difference]: Without dead ends: 1160 [2025-03-03 16:31:27,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:31:27,351 INFO L435 NwaCegarLoop]: 1397 mSDtfsCounter, 6 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:27,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2791 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:31:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-03-03 16:31:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1156. [2025-03-03 16:31:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1149 states have (on average 1.4978241949521323) internal successors, (1721), 1149 states have internal predecessors, (1721), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:31:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1731 transitions. [2025-03-03 16:31:27,373 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1731 transitions. Word has length 354 [2025-03-03 16:31:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:27,374 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1731 transitions. [2025-03-03 16:31:27,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1731 transitions. [2025-03-03 16:31:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-03 16:31:27,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:27,377 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:27,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:31:27,377 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:27,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:27,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1773312717, now seen corresponding path program 1 times [2025-03-03 16:31:27,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:27,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657314403] [2025-03-03 16:31:27,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:27,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:27,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-03 16:31:27,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-03 16:31:27,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:27,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 16:31:27,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:27,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657314403] [2025-03-03 16:31:27,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657314403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:27,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971845352] [2025-03-03 16:31:27,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:27,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:27,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:27,742 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-03 16:31:27,744 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-03 16:31:28,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-03 16:31:28,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-03 16:31:28,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:28,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:28,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 1345 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 16:31:28,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:28,248 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 16:31:28,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:31:28,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971845352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:31:28,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:31:28,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 10] total 15 [2025-03-03 16:31:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565675728] [2025-03-03 16:31:28,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:31:28,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 16:31:28,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:28,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 16:31:28,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:31:28,371 INFO L87 Difference]: Start difference. First operand 1156 states and 1731 transitions. Second operand has 15 states, 15 states have (on average 23.533333333333335) internal successors, (353), 15 states have internal predecessors, (353), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:31:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:29,401 INFO L93 Difference]: Finished difference Result 2303 states and 3451 transitions. [2025-03-03 16:31:29,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:31:29,402 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 23.533333333333335) internal successors, (353), 15 states have internal predecessors, (353), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 357 [2025-03-03 16:31:29,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:29,405 INFO L225 Difference]: With dead ends: 2303 [2025-03-03 16:31:29,405 INFO L226 Difference]: Without dead ends: 1165 [2025-03-03 16:31:29,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:31:29,407 INFO L435 NwaCegarLoop]: 1409 mSDtfsCounter, 39 mSDsluCounter, 16808 mSDsCounter, 0 mSdLazyCounter, 3614 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 18217 SdHoareTripleChecker+Invalid, 3615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:29,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 18217 Invalid, 3615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3614 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 16:31:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2025-03-03 16:31:29,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1161. [2025-03-03 16:31:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1154 states have (on average 1.4974003466204506) internal successors, (1728), 1154 states have internal predecessors, (1728), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:31:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1738 transitions. [2025-03-03 16:31:29,424 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1738 transitions. Word has length 357 [2025-03-03 16:31:29,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:29,424 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1738 transitions. [2025-03-03 16:31:29,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 23.533333333333335) internal successors, (353), 15 states have internal predecessors, (353), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:31:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1738 transitions. [2025-03-03 16:31:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-03 16:31:29,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:29,426 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:29,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 16:31:29,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:29,627 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:29,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1057826463, now seen corresponding path program 2 times [2025-03-03 16:31:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:29,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166951523] [2025-03-03 16:31:29,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:31:29,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:29,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 360 statements into 2 equivalence classes. [2025-03-03 16:31:29,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 279 of 360 statements. [2025-03-03 16:31:29,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 16:31:29,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:30,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:30,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166951523] [2025-03-03 16:31:30,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166951523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:30,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:31:30,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:31:30,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943506532] [2025-03-03 16:31:30,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:30,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:31:30,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:30,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:31:30,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:31:30,004 INFO L87 Difference]: Start difference. First operand 1161 states and 1738 transitions. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:30,563 INFO L93 Difference]: Finished difference Result 1165 states and 1742 transitions. [2025-03-03 16:31:30,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:30,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 360 [2025-03-03 16:31:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:30,566 INFO L225 Difference]: With dead ends: 1165 [2025-03-03 16:31:30,566 INFO L226 Difference]: Without dead ends: 1163 [2025-03-03 16:31:30,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:31:30,567 INFO L435 NwaCegarLoop]: 1397 mSDtfsCounter, 0 mSDsluCounter, 2789 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4186 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:30,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4186 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:31:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2025-03-03 16:31:30,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1163. [2025-03-03 16:31:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1156 states have (on average 1.4965397923875432) internal successors, (1730), 1156 states have internal predecessors, (1730), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:31:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1740 transitions. [2025-03-03 16:31:30,582 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1740 transitions. Word has length 360 [2025-03-03 16:31:30,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:30,583 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1740 transitions. [2025-03-03 16:31:30,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:30,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1740 transitions. [2025-03-03 16:31:30,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-03 16:31:30,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:30,585 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:30,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:31:30,585 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:30,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:30,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1571798019, now seen corresponding path program 1 times [2025-03-03 16:31:30,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:30,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101164951] [2025-03-03 16:31:30,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:30,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:30,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-03 16:31:30,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-03 16:31:30,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:30,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:30,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:30,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101164951] [2025-03-03 16:31:30,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101164951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:30,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091730509] [2025-03-03 16:31:30,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:30,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:30,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:30,833 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:30,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 16:31:31,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-03 16:31:31,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-03 16:31:31,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:31,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:31,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 1358 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 16:31:31,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 16:31:31,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:31:31,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091730509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:31,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:31:31,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-03-03 16:31:31,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386069888] [2025-03-03 16:31:31,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:31,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:31:31,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:31,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:31:31,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:31:31,489 INFO L87 Difference]: Start difference. First operand 1163 states and 1740 transitions. Second operand has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:32,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:32,622 INFO L93 Difference]: Finished difference Result 3060 states and 4589 transitions. [2025-03-03 16:31:32,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:32,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 361 [2025-03-03 16:31:32,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:32,630 INFO L225 Difference]: With dead ends: 3060 [2025-03-03 16:31:32,630 INFO L226 Difference]: Without dead ends: 2379 [2025-03-03 16:31:32,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:31:32,632 INFO L435 NwaCegarLoop]: 1919 mSDtfsCounter, 1871 mSDsluCounter, 5389 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1879 SdHoareTripleChecker+Valid, 7308 SdHoareTripleChecker+Invalid, 2589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:32,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1879 Valid, 7308 Invalid, 2589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 16:31:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-03-03 16:31:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1263. [2025-03-03 16:31:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1253 states have (on average 1.4940143655227454) internal successors, (1872), 1253 states have internal predecessors, (1872), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 16:31:32,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1888 transitions. [2025-03-03 16:31:32,658 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1888 transitions. Word has length 361 [2025-03-03 16:31:32,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:32,658 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1888 transitions. [2025-03-03 16:31:32,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1888 transitions. [2025-03-03 16:31:32,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-03 16:31:32,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:32,661 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:32,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 16:31:32,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:32,861 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:32,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:32,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1233112534, now seen corresponding path program 1 times [2025-03-03 16:31:32,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:32,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482503905] [2025-03-03 16:31:32,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:32,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:32,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-03 16:31:32,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-03 16:31:32,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:32,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:33,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:33,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482503905] [2025-03-03 16:31:33,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482503905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:33,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371058913] [2025-03-03 16:31:33,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:33,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:33,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:33,138 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:33,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 16:31:33,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-03 16:31:33,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-03 16:31:33,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:33,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:33,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 1358 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-03-03 16:31:33,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 16:31:33,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:34,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371058913] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:34,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:34,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4, 9] total 21 [2025-03-03 16:31:34,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463048509] [2025-03-03 16:31:34,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:34,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 16:31:34,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:34,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 16:31:34,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:31:34,229 INFO L87 Difference]: Start difference. First operand 1263 states and 1888 transitions. Second operand has 12 states, 12 states have (on average 26.75) internal successors, (321), 12 states have internal predecessors, (321), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:36,945 INFO L93 Difference]: Finished difference Result 2571 states and 3852 transitions. [2025-03-03 16:31:36,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:31:36,946 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.75) internal successors, (321), 12 states have internal predecessors, (321), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 361 [2025-03-03 16:31:36,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:36,952 INFO L225 Difference]: With dead ends: 2571 [2025-03-03 16:31:36,952 INFO L226 Difference]: Without dead ends: 1265 [2025-03-03 16:31:36,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2025-03-03 16:31:36,956 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 3056 mSDsluCounter, 5857 mSDsCounter, 0 mSdLazyCounter, 6705 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 6719 SdHoareTripleChecker+Invalid, 6750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 6705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:36,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 6719 Invalid, 6750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 6705 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 16:31:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2025-03-03 16:31:36,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2025-03-03 16:31:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1255 states have (on average 1.4924302788844621) internal successors, (1873), 1255 states have internal predecessors, (1873), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 16:31:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1889 transitions. [2025-03-03 16:31:36,982 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1889 transitions. Word has length 361 [2025-03-03 16:31:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:36,983 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1889 transitions. [2025-03-03 16:31:36,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.75) internal successors, (321), 12 states have internal predecessors, (321), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1889 transitions. [2025-03-03 16:31:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-03 16:31:36,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:36,985 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:36,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:37,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:37,187 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:37,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:37,187 INFO L85 PathProgramCache]: Analyzing trace with hash 386580934, now seen corresponding path program 1 times [2025-03-03 16:31:37,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:37,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652484059] [2025-03-03 16:31:37,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:37,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:37,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-03 16:31:37,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-03 16:31:37,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:37,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:37,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:37,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652484059] [2025-03-03 16:31:37,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652484059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:37,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20671698] [2025-03-03 16:31:37,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:37,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:37,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:37,477 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:37,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 16:31:37,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-03 16:31:37,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-03 16:31:37,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:37,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:37,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-03 16:31:37,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 16:31:38,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:38,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20671698] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:38,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:38,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 8] total 18 [2025-03-03 16:31:38,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255909462] [2025-03-03 16:31:38,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:38,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:31:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:38,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:31:38,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-03 16:31:38,965 INFO L87 Difference]: Start difference. First operand 1265 states and 1889 transitions. Second operand has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:40,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:40,289 INFO L93 Difference]: Finished difference Result 2050 states and 3062 transitions. [2025-03-03 16:31:40,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:40,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 362 [2025-03-03 16:31:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:40,295 INFO L225 Difference]: With dead ends: 2050 [2025-03-03 16:31:40,295 INFO L226 Difference]: Without dead ends: 1267 [2025-03-03 16:31:40,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:31:40,296 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 1650 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 3334 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 3365 SdHoareTripleChecker+Invalid, 3337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:40,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 3365 Invalid, 3337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3334 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 16:31:40,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-03-03 16:31:40,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1267. [2025-03-03 16:31:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1257 states have (on average 1.49085123309467) internal successors, (1874), 1257 states have internal predecessors, (1874), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 16:31:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1890 transitions. [2025-03-03 16:31:40,318 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1890 transitions. Word has length 362 [2025-03-03 16:31:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:40,319 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1890 transitions. [2025-03-03 16:31:40,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1890 transitions. [2025-03-03 16:31:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-03 16:31:40,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:40,321 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:40,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:40,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 16:31:40,522 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:40,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1129621052, now seen corresponding path program 1 times [2025-03-03 16:31:40,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:40,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653816893] [2025-03-03 16:31:40,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:40,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-03 16:31:40,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-03 16:31:40,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:40,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:40,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653816893] [2025-03-03 16:31:40,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653816893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024164359] [2025-03-03 16:31:40,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:40,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:40,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:40,817 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:40,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 16:31:41,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-03 16:31:41,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-03 16:31:41,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:41,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:41,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-03 16:31:41,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 16:31:41,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:42,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024164359] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:42,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:42,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 8] total 18 [2025-03-03 16:31:42,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400807272] [2025-03-03 16:31:42,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:42,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:31:42,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:42,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:31:42,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-03 16:31:42,136 INFO L87 Difference]: Start difference. First operand 1267 states and 1890 transitions. Second operand has 10 states, 10 states have (on average 32.3) internal successors, (323), 10 states have internal predecessors, (323), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:43,464 INFO L93 Difference]: Finished difference Result 2054 states and 3064 transitions. [2025-03-03 16:31:43,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:43,464 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.3) internal successors, (323), 10 states have internal predecessors, (323), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 363 [2025-03-03 16:31:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:43,468 INFO L225 Difference]: With dead ends: 2054 [2025-03-03 16:31:43,468 INFO L226 Difference]: Without dead ends: 1269 [2025-03-03 16:31:43,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 712 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:31:43,471 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 8194 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 3334 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8198 SdHoareTripleChecker+Valid, 3325 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:43,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8198 Valid, 3325 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3334 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 16:31:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2025-03-03 16:31:43,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1269. [2025-03-03 16:31:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1259 states have (on average 1.4892772041302622) internal successors, (1875), 1259 states have internal predecessors, (1875), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 16:31:43,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1891 transitions. [2025-03-03 16:31:43,490 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1891 transitions. Word has length 363 [2025-03-03 16:31:43,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:43,490 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 1891 transitions. [2025-03-03 16:31:43,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.3) internal successors, (323), 10 states have internal predecessors, (323), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1891 transitions. [2025-03-03 16:31:43,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-03 16:31:43,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:43,493 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:43,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 16:31:43,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:43,693 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:43,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:43,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1793247910, now seen corresponding path program 1 times [2025-03-03 16:31:43,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:43,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567327337] [2025-03-03 16:31:43,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:43,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:43,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-03 16:31:43,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-03 16:31:43,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:43,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:43,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:43,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567327337] [2025-03-03 16:31:43,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567327337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:43,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974991932] [2025-03-03 16:31:43,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:43,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:43,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:43,911 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:43,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 16:31:44,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-03 16:31:44,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-03 16:31:44,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:44,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:44,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 1367 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-03 16:31:44,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 16:31:44,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:45,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974991932] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:45,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:45,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 9] total 19 [2025-03-03 16:31:45,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648851548] [2025-03-03 16:31:45,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:45,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:31:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:45,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:31:45,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:31:45,181 INFO L87 Difference]: Start difference. First operand 1269 states and 1891 transitions. Second operand has 10 states, 10 states have (on average 32.4) internal successors, (324), 10 states have internal predecessors, (324), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:46,518 INFO L93 Difference]: Finished difference Result 2057 states and 3065 transitions. [2025-03-03 16:31:46,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:46,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.4) internal successors, (324), 10 states have internal predecessors, (324), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 364 [2025-03-03 16:31:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:46,522 INFO L225 Difference]: With dead ends: 2057 [2025-03-03 16:31:46,522 INFO L226 Difference]: Without dead ends: 1270 [2025-03-03 16:31:46,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:31:46,525 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 3258 mSDsluCounter, 2500 mSDsCounter, 0 mSdLazyCounter, 3335 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3260 SdHoareTripleChecker+Valid, 3334 SdHoareTripleChecker+Invalid, 3340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:46,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3260 Valid, 3334 Invalid, 3340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3335 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 16:31:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2025-03-03 16:31:46,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1270. [2025-03-03 16:31:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1260 states have (on average 1.488888888888889) internal successors, (1876), 1260 states have internal predecessors, (1876), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 16:31:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1892 transitions. [2025-03-03 16:31:46,545 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1892 transitions. Word has length 364 [2025-03-03 16:31:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:46,545 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1892 transitions. [2025-03-03 16:31:46,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.4) internal successors, (324), 10 states have internal predecessors, (324), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1892 transitions. [2025-03-03 16:31:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-03 16:31:46,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:46,547 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:46,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 16:31:46,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 16:31:46,748 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:46,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1610324932, now seen corresponding path program 1 times [2025-03-03 16:31:46,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:46,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729415299] [2025-03-03 16:31:46,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:46,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:46,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-03 16:31:46,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-03 16:31:46,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:46,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:47,034 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:47,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:47,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729415299] [2025-03-03 16:31:47,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729415299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:47,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421205559] [2025-03-03 16:31:47,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:47,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:47,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:47,038 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:47,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 16:31:47,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-03 16:31:47,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-03 16:31:47,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:47,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:47,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 1368 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-03 16:31:47,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 16:31:48,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:48,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421205559] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:48,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:48,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 9] total 19 [2025-03-03 16:31:48,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612317398] [2025-03-03 16:31:48,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:48,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:31:48,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:48,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:31:48,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:31:48,306 INFO L87 Difference]: Start difference. First operand 1270 states and 1892 transitions. Second operand has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:49,654 INFO L93 Difference]: Finished difference Result 2059 states and 3067 transitions. [2025-03-03 16:31:49,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:49,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 365 [2025-03-03 16:31:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:49,658 INFO L225 Difference]: With dead ends: 2059 [2025-03-03 16:31:49,658 INFO L226 Difference]: Without dead ends: 1271 [2025-03-03 16:31:49,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:31:49,660 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 6536 mSDsluCounter, 2509 mSDsCounter, 0 mSdLazyCounter, 3335 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6539 SdHoareTripleChecker+Valid, 3343 SdHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:49,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6539 Valid, 3343 Invalid, 3349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3335 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 16:31:49,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2025-03-03 16:31:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1271. [2025-03-03 16:31:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1261 states have (on average 1.4885011895321174) internal successors, (1877), 1261 states have internal predecessors, (1877), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 16:31:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1893 transitions. [2025-03-03 16:31:49,683 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1893 transitions. Word has length 365 [2025-03-03 16:31:49,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:49,683 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1893 transitions. [2025-03-03 16:31:49,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:49,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1893 transitions. [2025-03-03 16:31:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-03 16:31:49,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:49,685 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:49,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:49,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 16:31:49,886 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:49,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:49,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1465264415, now seen corresponding path program 1 times [2025-03-03 16:31:49,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:49,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114169017] [2025-03-03 16:31:49,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:49,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:49,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-03 16:31:49,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-03 16:31:49,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:49,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:50,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114169017] [2025-03-03 16:31:50,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114169017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509189581] [2025-03-03 16:31:50,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:50,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:50,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:50,204 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:50,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 16:31:50,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-03 16:31:50,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-03 16:31:50,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:50,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:50,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-03 16:31:50,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 16:31:51,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:51,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509189581] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:51,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:51,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 9] total 19 [2025-03-03 16:31:51,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986106870] [2025-03-03 16:31:51,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:51,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:31:51,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:51,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:31:51,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:31:51,535 INFO L87 Difference]: Start difference. First operand 1271 states and 1893 transitions. Second operand has 10 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:52,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:52,873 INFO L93 Difference]: Finished difference Result 2061 states and 3069 transitions. [2025-03-03 16:31:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:52,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 366 [2025-03-03 16:31:52,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:52,877 INFO L225 Difference]: With dead ends: 2061 [2025-03-03 16:31:52,877 INFO L226 Difference]: Without dead ends: 1272 [2025-03-03 16:31:52,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:31:52,878 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 3290 mSDsluCounter, 2518 mSDsCounter, 0 mSdLazyCounter, 3335 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3294 SdHoareTripleChecker+Valid, 3352 SdHoareTripleChecker+Invalid, 3342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:52,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3294 Valid, 3352 Invalid, 3342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3335 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 16:31:52,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2025-03-03 16:31:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1272. [2025-03-03 16:31:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1262 states have (on average 1.4881141045958794) internal successors, (1878), 1262 states have internal predecessors, (1878), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 16:31:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1894 transitions. [2025-03-03 16:31:52,900 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1894 transitions. Word has length 366 [2025-03-03 16:31:52,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:52,900 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1894 transitions. [2025-03-03 16:31:52,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1894 transitions. [2025-03-03 16:31:52,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-03 16:31:52,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:52,903 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:52,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:53,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 16:31:53,103 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:53,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:53,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1604830275, now seen corresponding path program 1 times [2025-03-03 16:31:53,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:53,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250179910] [2025-03-03 16:31:53,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:53,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:53,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-03 16:31:53,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-03 16:31:53,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:53,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:53,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:53,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250179910] [2025-03-03 16:31:53,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250179910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:53,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279105175] [2025-03-03 16:31:53,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:53,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:53,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:53,348 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:53,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 16:31:53,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-03 16:31:53,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-03 16:31:53,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:53,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:53,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 16:31:53,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 16:31:54,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:54,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279105175] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:54,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:54,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 7] total 17 [2025-03-03 16:31:54,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673572081] [2025-03-03 16:31:54,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:54,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:31:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:54,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:31:54,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:31:54,546 INFO L87 Difference]: Start difference. First operand 1272 states and 1894 transitions. Second operand has 10 states, 10 states have (on average 32.7) internal successors, (327), 10 states have internal predecessors, (327), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:56,902 INFO L93 Difference]: Finished difference Result 2135 states and 3171 transitions. [2025-03-03 16:31:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:31:56,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.7) internal successors, (327), 10 states have internal predecessors, (327), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 367 [2025-03-03 16:31:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:56,906 INFO L225 Difference]: With dead ends: 2135 [2025-03-03 16:31:56,906 INFO L226 Difference]: Without dead ends: 1278 [2025-03-03 16:31:56,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 721 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:31:56,907 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 1664 mSDsluCounter, 5873 mSDsCounter, 0 mSdLazyCounter, 6678 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 6736 SdHoareTripleChecker+Invalid, 6682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:56,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1668 Valid, 6736 Invalid, 6682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6678 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 16:31:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-03-03 16:31:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1276. [2025-03-03 16:31:56,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1266 states have (on average 1.4842022116903633) internal successors, (1879), 1266 states have internal predecessors, (1879), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 16:31:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1895 transitions. [2025-03-03 16:31:56,922 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1895 transitions. Word has length 367 [2025-03-03 16:31:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:56,922 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1895 transitions. [2025-03-03 16:31:56,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.7) internal successors, (327), 10 states have internal predecessors, (327), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:31:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1895 transitions. [2025-03-03 16:31:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-03 16:31:56,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:56,925 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:56,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:57,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 16:31:57,126 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:57,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1072282017, now seen corresponding path program 1 times [2025-03-03 16:31:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:57,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247552067] [2025-03-03 16:31:57,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:57,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-03 16:31:57,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-03 16:31:57,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:57,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:31:57,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:57,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247552067] [2025-03-03 16:31:57,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247552067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:57,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013417423] [2025-03-03 16:31:57,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:57,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:57,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:57,346 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:57,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 16:31:57,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-03 16:31:57,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-03 16:31:57,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:57,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:57,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 1376 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-03 16:31:57,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 16:31:58,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:31:58,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013417423] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:58,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:58,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 8] total 18 [2025-03-03 16:31:58,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026094503] [2025-03-03 16:31:58,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:58,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:31:58,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:58,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:31:58,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-03 16:31:58,550 INFO L87 Difference]: Start difference. First operand 1276 states and 1895 transitions. Second operand has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:59,919 INFO L93 Difference]: Finished difference Result 2072 states and 3075 transitions. [2025-03-03 16:31:59,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:59,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 369 [2025-03-03 16:31:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:59,923 INFO L225 Difference]: With dead ends: 2072 [2025-03-03 16:31:59,923 INFO L226 Difference]: Without dead ends: 1278 [2025-03-03 16:31:59,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:31:59,924 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 4936 mSDsluCounter, 2506 mSDsCounter, 0 mSdLazyCounter, 3335 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4940 SdHoareTripleChecker+Valid, 3339 SdHoareTripleChecker+Invalid, 3347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:59,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4940 Valid, 3339 Invalid, 3347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3335 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 16:31:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-03-03 16:31:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1278. [2025-03-03 16:31:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 1268 states have (on average 1.4834384858044165) internal successors, (1881), 1268 states have internal predecessors, (1881), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 16:31:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1897 transitions. [2025-03-03 16:31:59,938 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1897 transitions. Word has length 369 [2025-03-03 16:31:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:59,939 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1897 transitions. [2025-03-03 16:31:59,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:31:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1897 transitions. [2025-03-03 16:31:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-03 16:31:59,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:59,941 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:31:59,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 16:32:00,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:00,141 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:00,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash 812299116, now seen corresponding path program 1 times [2025-03-03 16:32:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:00,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330693011] [2025-03-03 16:32:00,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:00,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:00,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-03 16:32:00,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-03 16:32:00,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:00,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:00,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330693011] [2025-03-03 16:32:00,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330693011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625430645] [2025-03-03 16:32:00,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:00,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:00,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:00,365 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:32:00,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 16:32:00,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-03 16:32:00,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-03 16:32:00,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:00,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:00,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 16:32:00,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:01,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:32:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:32:01,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625430645] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:01,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:32:01,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 7] total 17 [2025-03-03 16:32:01,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429692970] [2025-03-03 16:32:01,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:01,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:32:01,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:01,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:32:01,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:32:01,592 INFO L87 Difference]: Start difference. First operand 1278 states and 1897 transitions. Second operand has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:03,774 INFO L93 Difference]: Finished difference Result 2192 states and 3241 transitions. [2025-03-03 16:32:03,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:32:03,775 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 369 [2025-03-03 16:32:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:03,778 INFO L225 Difference]: With dead ends: 2192 [2025-03-03 16:32:03,778 INFO L226 Difference]: Without dead ends: 1284 [2025-03-03 16:32:03,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:32:03,780 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 1722 mSDsluCounter, 5060 mSDsCounter, 0 mSdLazyCounter, 5834 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 5922 SdHoareTripleChecker+Invalid, 5839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 5834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:03,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 5922 Invalid, 5839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 5834 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 16:32:03,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2025-03-03 16:32:03,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1282. [2025-03-03 16:32:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1272 states have (on average 1.479559748427673) internal successors, (1882), 1272 states have internal predecessors, (1882), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 16:32:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1898 transitions. [2025-03-03 16:32:03,798 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1898 transitions. Word has length 369 [2025-03-03 16:32:03,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:03,799 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1898 transitions. [2025-03-03 16:32:03,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1898 transitions. [2025-03-03 16:32:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-03 16:32:03,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:03,801 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:32:03,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 16:32:04,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 16:32:04,001 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:04,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:04,002 INFO L85 PathProgramCache]: Analyzing trace with hash 3539668, now seen corresponding path program 1 times [2025-03-03 16:32:04,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:04,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913259870] [2025-03-03 16:32:04,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:04,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:04,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 16:32:04,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 16:32:04,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:04,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:04,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:04,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913259870] [2025-03-03 16:32:04,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913259870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:04,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922514581] [2025-03-03 16:32:04,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:04,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:04,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:04,247 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:32:04,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 16:32:04,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 16:32:04,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 16:32:04,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:04,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:04,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 16:32:04,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:05,345 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:05,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:32:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:32:05,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922514581] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:05,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:32:05,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 7] total 16 [2025-03-03 16:32:05,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429593727] [2025-03-03 16:32:05,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:05,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:32:05,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:05,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:32:05,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-03 16:32:05,500 INFO L87 Difference]: Start difference. First operand 1282 states and 1898 transitions. Second operand has 9 states, 9 states have (on average 36.77777777777778) internal successors, (331), 9 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:07,953 INFO L93 Difference]: Finished difference Result 2880 states and 4257 transitions. [2025-03-03 16:32:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:32:07,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 36.77777777777778) internal successors, (331), 9 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 371 [2025-03-03 16:32:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:07,959 INFO L225 Difference]: With dead ends: 2880 [2025-03-03 16:32:07,959 INFO L226 Difference]: Without dead ends: 2077 [2025-03-03 16:32:07,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:32:07,960 INFO L435 NwaCegarLoop]: 1262 mSDtfsCounter, 1882 mSDsluCounter, 5027 mSDsCounter, 0 mSdLazyCounter, 5629 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1883 SdHoareTripleChecker+Valid, 6289 SdHoareTripleChecker+Invalid, 5631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:07,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1883 Valid, 6289 Invalid, 5631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5629 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 16:32:07,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-03-03 16:32:07,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2075. [2025-03-03 16:32:07,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 2057 states have (on average 1.4783665532328634) internal successors, (3041), 2057 states have internal predecessors, (3041), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 16:32:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3073 transitions. [2025-03-03 16:32:07,983 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3073 transitions. Word has length 371 [2025-03-03 16:32:07,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:07,984 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 3073 transitions. [2025-03-03 16:32:07,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.77777777777778) internal successors, (331), 9 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:07,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3073 transitions. [2025-03-03 16:32:07,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-03 16:32:07,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:07,986 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:32:07,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-03 16:32:08,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:08,186 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:08,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:08,187 INFO L85 PathProgramCache]: Analyzing trace with hash -635909465, now seen corresponding path program 1 times [2025-03-03 16:32:08,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:08,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814797452] [2025-03-03 16:32:08,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:08,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:08,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 16:32:08,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 16:32:08,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:08,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:08,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814797452] [2025-03-03 16:32:08,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814797452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688671569] [2025-03-03 16:32:08,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:08,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:08,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:08,393 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:32:08,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 16:32:08,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 16:32:08,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 16:32:08,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:08,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:08,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 16:32:08,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:09,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:32:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:32:09,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688671569] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:09,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:32:09,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 7] total 16 [2025-03-03 16:32:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581594130] [2025-03-03 16:32:09,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:09,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:32:09,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:09,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:32:09,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-03 16:32:09,654 INFO L87 Difference]: Start difference. First operand 2075 states and 3073 transitions. Second operand has 9 states, 9 states have (on average 36.77777777777778) internal successors, (331), 9 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:11,928 INFO L93 Difference]: Finished difference Result 2874 states and 4249 transitions. [2025-03-03 16:32:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:32:11,928 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 36.77777777777778) internal successors, (331), 9 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 371 [2025-03-03 16:32:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:11,935 INFO L225 Difference]: With dead ends: 2874 [2025-03-03 16:32:11,936 INFO L226 Difference]: Without dead ends: 2074 [2025-03-03 16:32:11,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:32:11,937 INFO L435 NwaCegarLoop]: 1261 mSDtfsCounter, 3778 mSDsluCounter, 5027 mSDsCounter, 0 mSdLazyCounter, 5625 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3780 SdHoareTripleChecker+Valid, 6288 SdHoareTripleChecker+Invalid, 5632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:11,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3780 Valid, 6288 Invalid, 5632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 5625 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 16:32:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2025-03-03 16:32:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2072. [2025-03-03 16:32:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 2054 states have (on average 1.4785783836416748) internal successors, (3037), 2054 states have internal predecessors, (3037), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 16:32:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 3069 transitions. [2025-03-03 16:32:11,965 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 3069 transitions. Word has length 371 [2025-03-03 16:32:11,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:11,965 INFO L471 AbstractCegarLoop]: Abstraction has 2072 states and 3069 transitions. [2025-03-03 16:32:11,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.77777777777778) internal successors, (331), 9 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3069 transitions. [2025-03-03 16:32:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-03 16:32:11,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:11,967 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:32:11,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-03 16:32:12,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:12,167 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:12,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:12,168 INFO L85 PathProgramCache]: Analyzing trace with hash -623783621, now seen corresponding path program 1 times [2025-03-03 16:32:12,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:12,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385152667] [2025-03-03 16:32:12,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:12,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:12,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 16:32:12,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 16:32:12,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:12,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:12,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:12,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385152667] [2025-03-03 16:32:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385152667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:12,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002512294] [2025-03-03 16:32:12,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:12,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:12,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:12,390 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:32:12,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 16:32:12,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 16:32:13,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 16:32:13,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:13,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:13,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 16:32:13,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:13,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:32:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:32:13,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002512294] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:13,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:32:13,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 7] total 16 [2025-03-03 16:32:13,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253744636] [2025-03-03 16:32:13,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:13,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:32:13,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:13,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:32:13,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-03 16:32:13,548 INFO L87 Difference]: Start difference. First operand 2072 states and 3069 transitions. Second operand has 9 states, 9 states have (on average 36.77777777777778) internal successors, (331), 9 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:15,840 INFO L93 Difference]: Finished difference Result 2868 states and 4241 transitions. [2025-03-03 16:32:15,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:32:15,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 36.77777777777778) internal successors, (331), 9 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 371 [2025-03-03 16:32:15,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:15,844 INFO L225 Difference]: With dead ends: 2868 [2025-03-03 16:32:15,844 INFO L226 Difference]: Without dead ends: 2068 [2025-03-03 16:32:15,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:32:15,846 INFO L435 NwaCegarLoop]: 1262 mSDtfsCounter, 1940 mSDsluCounter, 5027 mSDsCounter, 0 mSdLazyCounter, 5631 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1944 SdHoareTripleChecker+Valid, 6289 SdHoareTripleChecker+Invalid, 5636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 5631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:15,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1944 Valid, 6289 Invalid, 5636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 5631 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 16:32:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2025-03-03 16:32:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2066. [2025-03-03 16:32:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 2048 states have (on average 1.478515625) internal successors, (3028), 2048 states have internal predecessors, (3028), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 16:32:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 3060 transitions. [2025-03-03 16:32:15,874 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 3060 transitions. Word has length 371 [2025-03-03 16:32:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:15,874 INFO L471 AbstractCegarLoop]: Abstraction has 2066 states and 3060 transitions. [2025-03-03 16:32:15,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.77777777777778) internal successors, (331), 9 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 3060 transitions. [2025-03-03 16:32:15,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-03 16:32:15,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:15,876 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:32:15,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-03 16:32:16,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:16,077 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:16,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:16,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1438503591, now seen corresponding path program 1 times [2025-03-03 16:32:16,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:16,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946044316] [2025-03-03 16:32:16,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:16,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:16,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 16:32:16,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 16:32:16,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:16,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:16,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:16,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946044316] [2025-03-03 16:32:16,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946044316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:16,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486515811] [2025-03-03 16:32:16,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:16,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:16,286 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:32:16,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 16:32:16,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 16:32:16,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 16:32:16,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:16,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:16,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 16:32:16,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:17,457 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-03 16:32:17,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:32:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:32:18,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486515811] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:18,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:32:18,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 9] total 18 [2025-03-03 16:32:18,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532243564] [2025-03-03 16:32:18,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:18,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:32:18,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:18,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:32:18,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-03 16:32:18,359 INFO L87 Difference]: Start difference. First operand 2066 states and 3060 transitions. Second operand has 9 states, 9 states have (on average 36.77777777777778) internal successors, (331), 9 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:20,575 INFO L93 Difference]: Finished difference Result 4364 states and 6396 transitions. [2025-03-03 16:32:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:32:20,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 36.77777777777778) internal successors, (331), 9 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 371 [2025-03-03 16:32:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:20,580 INFO L225 Difference]: With dead ends: 4364 [2025-03-03 16:32:20,580 INFO L226 Difference]: Without dead ends: 2693 [2025-03-03 16:32:20,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2025-03-03 16:32:20,583 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 2166 mSDsluCounter, 4334 mSDsCounter, 0 mSdLazyCounter, 5189 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2171 SdHoareTripleChecker+Valid, 5210 SdHoareTripleChecker+Invalid, 5219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:20,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2171 Valid, 5210 Invalid, 5219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5189 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 16:32:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2025-03-03 16:32:20,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2370. [2025-03-03 16:32:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 2342 states have (on average 1.468403074295474) internal successors, (3439), 2342 states have internal predecessors, (3439), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 16:32:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 3491 transitions. [2025-03-03 16:32:20,615 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 3491 transitions. Word has length 371 [2025-03-03 16:32:20,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:20,616 INFO L471 AbstractCegarLoop]: Abstraction has 2370 states and 3491 transitions. [2025-03-03 16:32:20,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.77777777777778) internal successors, (331), 9 states have internal predecessors, (331), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3491 transitions. [2025-03-03 16:32:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-03 16:32:20,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:20,618 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:32:20,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-03 16:32:20,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:20,818 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:20,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:20,819 INFO L85 PathProgramCache]: Analyzing trace with hash -2136524200, now seen corresponding path program 1 times [2025-03-03 16:32:20,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:20,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140269767] [2025-03-03 16:32:20,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:20,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:20,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 16:32:20,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 16:32:20,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:20,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:21,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:21,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140269767] [2025-03-03 16:32:21,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140269767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:21,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797033086] [2025-03-03 16:32:21,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:21,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:21,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:21,028 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:32:21,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 16:32:21,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 16:32:21,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 16:32:21,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:21,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:21,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 16:32:21,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 16:32:21,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:32:21,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797033086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:21,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:32:21,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-03-03 16:32:21,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157952623] [2025-03-03 16:32:21,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:21,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:32:21,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:21,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:32:21,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:32:21,820 INFO L87 Difference]: Start difference. First operand 2370 states and 3491 transitions. Second operand has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:23,084 INFO L93 Difference]: Finished difference Result 5254 states and 7761 transitions. [2025-03-03 16:32:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:32:23,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 371 [2025-03-03 16:32:23,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:23,091 INFO L225 Difference]: With dead ends: 5254 [2025-03-03 16:32:23,091 INFO L226 Difference]: Without dead ends: 3610 [2025-03-03 16:32:23,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:32:23,093 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 2557 mSDsluCounter, 2511 mSDsCounter, 0 mSdLazyCounter, 3292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2565 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 3293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:23,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2565 Valid, 3355 Invalid, 3293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3292 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 16:32:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3610 states. [2025-03-03 16:32:23,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3610 to 2264. [2025-03-03 16:32:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 2239 states have (on average 1.4707458686913801) internal successors, (3293), 2239 states have internal predecessors, (3293), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 16:32:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 3339 transitions. [2025-03-03 16:32:23,126 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 3339 transitions. Word has length 371 [2025-03-03 16:32:23,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:23,127 INFO L471 AbstractCegarLoop]: Abstraction has 2264 states and 3339 transitions. [2025-03-03 16:32:23,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 3339 transitions. [2025-03-03 16:32:23,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-03 16:32:23,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:23,129 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:32:23,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-03 16:32:23,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 16:32:23,329 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:23,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1636575105, now seen corresponding path program 1 times [2025-03-03 16:32:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:23,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588566566] [2025-03-03 16:32:23,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:23,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 16:32:23,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 16:32:23,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:23,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:23,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:23,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588566566] [2025-03-03 16:32:23,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588566566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:23,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469774833] [2025-03-03 16:32:23,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:23,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:23,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:23,545 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:32:23,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-03 16:32:24,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 16:32:24,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 16:32:24,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:24,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:24,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-03 16:32:24,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 16:32:25,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:32:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:32:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469774833] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:25,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:32:25,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 11] total 17 [2025-03-03 16:32:25,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520718712] [2025-03-03 16:32:25,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:25,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:32:25,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:25,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:32:25,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:32:25,478 INFO L87 Difference]: Start difference. First operand 2264 states and 3339 transitions. Second operand has 6 states, 6 states have (on average 55.333333333333336) internal successors, (332), 6 states have internal predecessors, (332), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:26,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:26,869 INFO L93 Difference]: Finished difference Result 4830 states and 7107 transitions. [2025-03-03 16:32:26,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:32:26,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 55.333333333333336) internal successors, (332), 6 states have internal predecessors, (332), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 372 [2025-03-03 16:32:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:26,874 INFO L225 Difference]: With dead ends: 4830 [2025-03-03 16:32:26,874 INFO L226 Difference]: Without dead ends: 3173 [2025-03-03 16:32:26,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 731 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-03-03 16:32:26,876 INFO L435 NwaCegarLoop]: 1002 mSDtfsCounter, 2564 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2570 SdHoareTripleChecker+Valid, 3657 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:26,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2570 Valid, 3657 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 16:32:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2025-03-03 16:32:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 2951. [2025-03-03 16:32:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 2922 states have (on average 1.4715947980835045) internal successors, (4300), 2922 states have internal predecessors, (4300), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 16:32:26,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 4354 transitions. [2025-03-03 16:32:26,908 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 4354 transitions. Word has length 372 [2025-03-03 16:32:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:26,908 INFO L471 AbstractCegarLoop]: Abstraction has 2951 states and 4354 transitions. [2025-03-03 16:32:26,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.333333333333336) internal successors, (332), 6 states have internal predecessors, (332), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 4354 transitions. [2025-03-03 16:32:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-03 16:32:26,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:26,911 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:32:26,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-03 16:32:27,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-03 16:32:27,112 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:27,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:27,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1299199516, now seen corresponding path program 1 times [2025-03-03 16:32:27,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:27,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523324399] [2025-03-03 16:32:27,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:27,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:27,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 16:32:27,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 16:32:27,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:27,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:27,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523324399] [2025-03-03 16:32:27,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523324399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90669751] [2025-03-03 16:32:27,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:27,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:27,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:27,329 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:32:27,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-03 16:32:27,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 16:32:28,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 16:32:28,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:28,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:28,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 16:32:28,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:28,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:32:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:32:28,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90669751] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:28,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:32:28,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 5] total 11 [2025-03-03 16:32:28,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512251372] [2025-03-03 16:32:28,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:28,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:32:28,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:28,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:32:28,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:32:28,619 INFO L87 Difference]: Start difference. First operand 2951 states and 4354 transitions. Second operand has 6 states, 6 states have (on average 55.333333333333336) internal successors, (332), 6 states have internal predecessors, (332), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:29,554 INFO L93 Difference]: Finished difference Result 3839 states and 5647 transitions. [2025-03-03 16:32:29,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:32:29,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 55.333333333333336) internal successors, (332), 6 states have internal predecessors, (332), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 372 [2025-03-03 16:32:29,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:29,561 INFO L225 Difference]: With dead ends: 3839 [2025-03-03 16:32:29,561 INFO L226 Difference]: Without dead ends: 3077 [2025-03-03 16:32:29,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 737 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:32:29,563 INFO L435 NwaCegarLoop]: 1453 mSDtfsCounter, 1112 mSDsluCounter, 3682 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 5135 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:29,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 5135 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:32:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2025-03-03 16:32:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2999. [2025-03-03 16:32:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2999 states, 2968 states have (on average 1.4706873315363882) internal successors, (4365), 2968 states have internal predecessors, (4365), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 16:32:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 4423 transitions. [2025-03-03 16:32:29,604 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 4423 transitions. Word has length 372 [2025-03-03 16:32:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:29,604 INFO L471 AbstractCegarLoop]: Abstraction has 2999 states and 4423 transitions. [2025-03-03 16:32:29,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.333333333333336) internal successors, (332), 6 states have internal predecessors, (332), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 4423 transitions. [2025-03-03 16:32:29,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-03 16:32:29,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:29,609 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:32:29,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-03 16:32:29,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:29,810 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:29,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1959236206, now seen corresponding path program 1 times [2025-03-03 16:32:29,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:29,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755277435] [2025-03-03 16:32:29,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:29,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:29,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 16:32:29,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 16:32:29,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:29,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:30,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:30,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755277435] [2025-03-03 16:32:30,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755277435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:30,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163111282] [2025-03-03 16:32:30,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:30,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:30,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:30,016 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:32:30,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-03 16:32:30,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 16:32:30,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 16:32:30,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:30,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:30,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-03 16:32:30,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 16:32:31,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:32:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:32:31,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163111282] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:31,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:32:31,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 8] total 17 [2025-03-03 16:32:31,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775937427] [2025-03-03 16:32:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:31,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:32:31,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:31,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:32:31,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:32:31,500 INFO L87 Difference]: Start difference. First operand 2999 states and 4423 transitions. Second operand has 9 states, 9 states have (on average 36.888888888888886) internal successors, (332), 9 states have internal predecessors, (332), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:32,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:32,932 INFO L93 Difference]: Finished difference Result 3830 states and 5633 transitions. [2025-03-03 16:32:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:32:32,932 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 36.888888888888886) internal successors, (332), 9 states have internal predecessors, (332), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 372 [2025-03-03 16:32:32,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:32,937 INFO L225 Difference]: With dead ends: 3830 [2025-03-03 16:32:32,937 INFO L226 Difference]: Without dead ends: 2337 [2025-03-03 16:32:32,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 731 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:32:32,939 INFO L435 NwaCegarLoop]: 2127 mSDtfsCounter, 2005 mSDsluCounter, 9380 mSDsCounter, 0 mSdLazyCounter, 3136 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 11507 SdHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:32,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 11507 Invalid, 3151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 16:32:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2025-03-03 16:32:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2329. [2025-03-03 16:32:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 2302 states have (on average 1.4600347523892268) internal successors, (3361), 2302 states have internal predecessors, (3361), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 16:32:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3411 transitions. [2025-03-03 16:32:32,971 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3411 transitions. Word has length 372 [2025-03-03 16:32:32,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:32,971 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 3411 transitions. [2025-03-03 16:32:32,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.888888888888886) internal successors, (332), 9 states have internal predecessors, (332), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3411 transitions. [2025-03-03 16:32:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-03 16:32:32,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:32,974 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:32:32,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-03 16:32:33,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:33,176 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:33,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:33,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1732928619, now seen corresponding path program 1 times [2025-03-03 16:32:33,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:33,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482033944] [2025-03-03 16:32:33,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:33,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:33,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 16:32:33,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 16:32:33,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:33,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:33,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:33,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482033944] [2025-03-03 16:32:33,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482033944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:33,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960839571] [2025-03-03 16:32:33,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:33,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:33,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:33,435 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:32:33,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-03 16:32:34,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 16:32:34,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 16:32:34,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:34,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:34,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 16:32:34,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:34,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:32:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 16:32:34,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960839571] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:34,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:32:34,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 5] total 11 [2025-03-03 16:32:34,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385640873] [2025-03-03 16:32:34,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:34,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:32:34,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:34,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:32:34,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:32:34,737 INFO L87 Difference]: Start difference. First operand 2329 states and 3411 transitions. Second operand has 6 states, 6 states have (on average 55.333333333333336) internal successors, (332), 6 states have internal predecessors, (332), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:35,853 INFO L93 Difference]: Finished difference Result 2335 states and 3415 transitions. [2025-03-03 16:32:35,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:32:35,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 55.333333333333336) internal successors, (332), 6 states have internal predecessors, (332), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 372 [2025-03-03 16:32:35,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:35,857 INFO L225 Difference]: With dead ends: 2335 [2025-03-03 16:32:35,857 INFO L226 Difference]: Without dead ends: 2196 [2025-03-03 16:32:35,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 737 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:32:35,858 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 1700 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 2506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 2575 SdHoareTripleChecker+Invalid, 2507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:35,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 2575 Invalid, 2507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2506 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 16:32:35,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2025-03-03 16:32:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2196. [2025-03-03 16:32:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2196 states, 2174 states have (on average 1.46688132474701) internal successors, (3189), 2174 states have internal predecessors, (3189), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 16:32:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 3229 transitions. [2025-03-03 16:32:35,885 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 3229 transitions. Word has length 372 [2025-03-03 16:32:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:35,885 INFO L471 AbstractCegarLoop]: Abstraction has 2196 states and 3229 transitions. [2025-03-03 16:32:35,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.333333333333336) internal successors, (332), 6 states have internal predecessors, (332), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:32:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 3229 transitions. [2025-03-03 16:32:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-03 16:32:35,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:35,888 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:32:35,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-03 16:32:36,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 16:32:36,089 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:36,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:36,089 INFO L85 PathProgramCache]: Analyzing trace with hash 324680898, now seen corresponding path program 1 times [2025-03-03 16:32:36,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:36,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031886094] [2025-03-03 16:32:36,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:36,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:36,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-03 16:32:36,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-03 16:32:36,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:36,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 16:32:36,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:36,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031886094] [2025-03-03 16:32:36,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031886094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:32:36,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670950308] [2025-03-03 16:32:36,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:36,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:36,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:36,355 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:32:36,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-03 16:32:36,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes.