./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 588d5c1b74b435c7b48e7846cdcbcdd05a5e0ef56f650b6f67ae59d316b919cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:18:56,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:18:56,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:18:56,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:18:56,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:18:56,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:18:56,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:18:56,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:18:56,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:18:56,942 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:18:56,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:18:56,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:18:56,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:18:56,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:18:56,944 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:18:56,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:18:56,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:18:56,944 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:18:56,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:18:56,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:18:56,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:18:56,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:18:56,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:18:56,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:18:56,945 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:18:56,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:18:56,945 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:18:56,945 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:18:56,945 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:18:56,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:18:56,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:18:56,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:18:56,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:18:56,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:18:56,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:18:56,946 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:18:56,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:18:56,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:18:56,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:18:56,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:18:56,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:18:56,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:18:56,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:18:56,947 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 588d5c1b74b435c7b48e7846cdcbcdd05a5e0ef56f650b6f67ae59d316b919cf [2025-03-08 16:18:57,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:18:57,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:18:57,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:18:57,154 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:18:57,154 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:18:57,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i [2025-03-08 16:18:58,232 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61df33536/79ac771bb29043d8842e17205b7e04ee/FLAG32d743c3a [2025-03-08 16:18:58,442 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:18:58,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i [2025-03-08 16:18:58,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61df33536/79ac771bb29043d8842e17205b7e04ee/FLAG32d743c3a [2025-03-08 16:18:58,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61df33536/79ac771bb29043d8842e17205b7e04ee [2025-03-08 16:18:58,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:18:58,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:18:58,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:18:58,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:18:58,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:18:58,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:18:58" (1/1) ... [2025-03-08 16:18:58,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@942d2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:58, skipping insertion in model container [2025-03-08 16:18:58,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:18:58" (1/1) ... [2025-03-08 16:18:58,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:18:58,907 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i[916,929] [2025-03-08 16:18:58,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:18:58,985 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:18:58,992 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i[916,929] [2025-03-08 16:18:59,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:18:59,047 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:18:59,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:59 WrapperNode [2025-03-08 16:18:59,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:18:59,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:18:59,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:18:59,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:18:59,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:59" (1/1) ... [2025-03-08 16:18:59,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:59" (1/1) ... [2025-03-08 16:18:59,101 INFO L138 Inliner]: procedures = 26, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 441 [2025-03-08 16:18:59,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:18:59,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:18:59,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:18:59,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:18:59,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:59" (1/1) ... [2025-03-08 16:18:59,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:59" (1/1) ... [2025-03-08 16:18:59,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:59" (1/1) ... [2025-03-08 16:18:59,135 INFO L175 MemorySlicer]: Split 125 memory accesses to 6 slices as follows [2, 6, 11, 7, 74, 25]. 59 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 6, 2]. The 15 writes are split as follows [0, 1, 1, 3, 8, 2]. [2025-03-08 16:18:59,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:59" (1/1) ... [2025-03-08 16:18:59,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:59" (1/1) ... [2025-03-08 16:18:59,145 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:59" (1/1) ... [2025-03-08 16:18:59,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:59" (1/1) ... [2025-03-08 16:18:59,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:59" (1/1) ... [2025-03-08 16:18:59,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:59" (1/1) ... [2025-03-08 16:18:59,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:18:59,153 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:18:59,153 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:18:59,153 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:18:59,153 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:59" (1/1) ... [2025-03-08 16:18:59,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:18:59,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:18:59,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:18:59,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:18:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:18:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:18:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:18:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:18:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:18:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:18:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:18:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:18:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:18:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:18:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:18:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:18:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:18:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:18:59,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:18:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:18:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:18:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:18:59,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:18:59,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:18:59,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:18:59,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:18:59,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:18:59,298 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:18:59,300 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:18:59,659 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~mem68#1;havoc property_#t~ite83#1;havoc property_#t~mem74#1;havoc property_#t~mem70#1;havoc property_#t~mem69#1;havoc property_#t~ite73#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~ite82#1;havoc property_#t~mem79#1;havoc property_#t~mem78#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~mem87#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite115#1;havoc property_#t~mem90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~short91#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite107#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-08 16:18:59,688 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-08 16:18:59,688 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:18:59,699 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:18:59,700 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:18:59,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:18:59 BoogieIcfgContainer [2025-03-08 16:18:59,701 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:18:59,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:18:59,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:18:59,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:18:59,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:18:58" (1/3) ... [2025-03-08 16:18:59,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@faa916a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:18:59, skipping insertion in model container [2025-03-08 16:18:59,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:59" (2/3) ... [2025-03-08 16:18:59,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@faa916a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:18:59, skipping insertion in model container [2025-03-08 16:18:59,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:18:59" (3/3) ... [2025-03-08 16:18:59,708 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-58.i [2025-03-08 16:18:59,717 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:18:59,720 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-58.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:18:59,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:18:59,770 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;@6606592f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:18:59,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:18:59,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:18:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:18:59,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:59,782 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:59,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:59,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:59,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1310023672, now seen corresponding path program 1 times [2025-03-08 16:18:59,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:59,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847478982] [2025-03-08 16:18:59,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:59,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:59,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:18:59,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:18:59,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:59,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 16:19:00,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:00,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847478982] [2025-03-08 16:19:00,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847478982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:19:00,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162954507] [2025-03-08 16:19:00,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:00,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:19:00,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:19:00,050 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-08 16:19:00,052 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-08 16:19:00,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:19:00,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:19:00,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:00,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:00,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:19:00,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:19:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 16:19:00,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:19:00,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162954507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:00,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:19:00,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:19:00,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907551729] [2025-03-08 16:19:00,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:00,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:19:00,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:00,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:19:00,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:19:00,265 INFO L87 Difference]: Start difference. First operand has 91 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:00,283 INFO L93 Difference]: Finished difference Result 172 states and 266 transitions. [2025-03-08 16:19:00,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:19:00,284 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2025-03-08 16:19:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:00,289 INFO L225 Difference]: With dead ends: 172 [2025-03-08 16:19:00,289 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 16:19:00,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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-08 16:19:00,295 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:00,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:19:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 16:19:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-08 16:19:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:19:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2025-03-08 16:19:00,322 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 116 [2025-03-08 16:19:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:00,322 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2025-03-08 16:19:00,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2025-03-08 16:19:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:19:00,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:00,325 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:00,332 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-08 16:19:00,526 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-08 16:19:00,526 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:00,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:00,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1552441257, now seen corresponding path program 1 times [2025-03-08 16:19:00,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:00,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881884728] [2025-03-08 16:19:00,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:00,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:00,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:19:00,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:19:00,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:00,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:00,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:00,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881884728] [2025-03-08 16:19:00,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881884728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:00,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:00,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:19:00,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302799486] [2025-03-08 16:19:00,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:00,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:19:00,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:00,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:19:00,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:19:00,799 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:00,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:00,834 INFO L93 Difference]: Finished difference Result 168 states and 237 transitions. [2025-03-08 16:19:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:19:00,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2025-03-08 16:19:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:00,838 INFO L225 Difference]: With dead ends: 168 [2025-03-08 16:19:00,838 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 16:19:00,838 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-08 16:19:00,839 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:00,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 336 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:19:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 16:19:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-03-08 16:19:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:19:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2025-03-08 16:19:00,848 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 116 [2025-03-08 16:19:00,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:00,849 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2025-03-08 16:19:00,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2025-03-08 16:19:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:19:00,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:00,850 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:00,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:19:00,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:00,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1551517736, now seen corresponding path program 1 times [2025-03-08 16:19:00,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:00,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913774282] [2025-03-08 16:19:00,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:00,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:19:00,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:19:00,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:00,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:01,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:01,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913774282] [2025-03-08 16:19:01,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913774282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:01,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:01,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:19:01,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092551824] [2025-03-08 16:19:01,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:01,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:19:01,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:01,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:19:01,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:19:01,284 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:01,480 INFO L93 Difference]: Finished difference Result 249 states and 349 transitions. [2025-03-08 16:19:01,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:19:01,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2025-03-08 16:19:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:01,483 INFO L225 Difference]: With dead ends: 249 [2025-03-08 16:19:01,485 INFO L226 Difference]: Without dead ends: 166 [2025-03-08 16:19:01,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:19:01,486 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 105 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:01,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 525 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:19:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-08 16:19:01,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2025-03-08 16:19:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 131 states have (on average 1.297709923664122) internal successors, (170), 131 states have internal predecessors, (170), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:19:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 230 transitions. [2025-03-08 16:19:01,509 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 230 transitions. Word has length 116 [2025-03-08 16:19:01,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:01,509 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 230 transitions. [2025-03-08 16:19:01,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 230 transitions. [2025-03-08 16:19:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:19:01,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:01,512 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:01,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:19:01,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:01,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash -806669732, now seen corresponding path program 1 times [2025-03-08 16:19:01,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:01,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468225143] [2025-03-08 16:19:01,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:01,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:01,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:19:01,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:19:01,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:01,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:02,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:02,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468225143] [2025-03-08 16:19:02,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468225143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:02,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:02,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:19:02,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102665370] [2025-03-08 16:19:02,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:02,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:19:02,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:02,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:19:02,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:19:02,186 INFO L87 Difference]: Start difference. First operand 164 states and 230 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:02,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:02,376 INFO L93 Difference]: Finished difference Result 394 states and 551 transitions. [2025-03-08 16:19:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:19:02,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2025-03-08 16:19:02,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:02,379 INFO L225 Difference]: With dead ends: 394 [2025-03-08 16:19:02,379 INFO L226 Difference]: Without dead ends: 233 [2025-03-08 16:19:02,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:19:02,380 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 83 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:02,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 566 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:19:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-08 16:19:02,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2025-03-08 16:19:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 185 states have (on average 1.2918918918918918) internal successors, (239), 186 states have internal predecessors, (239), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 16:19:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 321 transitions. [2025-03-08 16:19:02,410 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 321 transitions. Word has length 116 [2025-03-08 16:19:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:02,410 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 321 transitions. [2025-03-08 16:19:02,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 321 transitions. [2025-03-08 16:19:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:19:02,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:02,412 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:02,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:19:02,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:02,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:02,413 INFO L85 PathProgramCache]: Analyzing trace with hash -677587013, now seen corresponding path program 1 times [2025-03-08 16:19:02,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:02,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135985090] [2025-03-08 16:19:02,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:02,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:02,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:19:02,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:19:02,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:02,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:03,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:03,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135985090] [2025-03-08 16:19:03,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135985090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:03,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:03,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:19:03,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635086353] [2025-03-08 16:19:03,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:03,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:19:03,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:03,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:19:03,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:19:03,615 INFO L87 Difference]: Start difference. First operand 230 states and 321 transitions. Second operand has 10 states, 6 states have (on average 7.333333333333333) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-08 16:19:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:04,156 INFO L93 Difference]: Finished difference Result 485 states and 672 transitions. [2025-03-08 16:19:04,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:19:04,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 6 states have (on average 7.333333333333333) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 5 states have call successors, (15) Word has length 116 [2025-03-08 16:19:04,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:04,160 INFO L225 Difference]: With dead ends: 485 [2025-03-08 16:19:04,162 INFO L226 Difference]: Without dead ends: 258 [2025-03-08 16:19:04,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:19:04,164 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 82 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:04,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 684 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:19:04,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-08 16:19:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 246. [2025-03-08 16:19:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 194 states have (on average 1.268041237113402) internal successors, (246), 196 states have internal predecessors, (246), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:19:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 338 transitions. [2025-03-08 16:19:04,198 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 338 transitions. Word has length 116 [2025-03-08 16:19:04,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:04,199 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 338 transitions. [2025-03-08 16:19:04,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 6 states have (on average 7.333333333333333) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-08 16:19:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 338 transitions. [2025-03-08 16:19:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:19:04,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:04,200 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:04,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:19:04,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:04,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:04,201 INFO L85 PathProgramCache]: Analyzing trace with hash 546639965, now seen corresponding path program 1 times [2025-03-08 16:19:04,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:04,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193354665] [2025-03-08 16:19:04,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:04,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:04,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:19:04,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:19:04,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:04,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:04,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:04,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193354665] [2025-03-08 16:19:04,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193354665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:04,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:04,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:19:04,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141801132] [2025-03-08 16:19:04,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:04,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:19:04,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:04,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:19:04,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:19:04,986 INFO L87 Difference]: Start difference. First operand 246 states and 338 transitions. Second operand has 9 states, 6 states have (on average 7.333333333333333) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 16:19:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:05,449 INFO L93 Difference]: Finished difference Result 528 states and 726 transitions. [2025-03-08 16:19:05,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:19:05,449 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 7.333333333333333) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 116 [2025-03-08 16:19:05,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:05,451 INFO L225 Difference]: With dead ends: 528 [2025-03-08 16:19:05,451 INFO L226 Difference]: Without dead ends: 300 [2025-03-08 16:19:05,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:19:05,452 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 81 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:05,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 798 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:19:05,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-08 16:19:05,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2025-03-08 16:19:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 239 states have (on average 1.2761506276150627) internal successors, (305), 242 states have internal predecessors, (305), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 16:19:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 407 transitions. [2025-03-08 16:19:05,478 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 407 transitions. Word has length 116 [2025-03-08 16:19:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:05,479 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 407 transitions. [2025-03-08 16:19:05,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 7.333333333333333) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 16:19:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 407 transitions. [2025-03-08 16:19:05,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:19:05,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:05,480 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:05,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:19:05,480 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:05,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:05,480 INFO L85 PathProgramCache]: Analyzing trace with hash 675722684, now seen corresponding path program 1 times [2025-03-08 16:19:05,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:05,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614285859] [2025-03-08 16:19:05,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:05,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:05,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:19:05,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:19:05,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:05,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:05,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614285859] [2025-03-08 16:19:05,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614285859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:05,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:05,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:19:05,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848254001] [2025-03-08 16:19:05,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:05,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:19:05,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:05,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:19:05,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:19:05,952 INFO L87 Difference]: Start difference. First operand 297 states and 407 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:06,184 INFO L93 Difference]: Finished difference Result 579 states and 794 transitions. [2025-03-08 16:19:06,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:19:06,185 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2025-03-08 16:19:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:06,187 INFO L225 Difference]: With dead ends: 579 [2025-03-08 16:19:06,187 INFO L226 Difference]: Without dead ends: 300 [2025-03-08 16:19:06,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:19:06,188 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 63 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:06,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 895 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:19:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-08 16:19:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2025-03-08 16:19:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 239 states have (on average 1.2719665271966527) internal successors, (304), 242 states have internal predecessors, (304), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 16:19:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 406 transitions. [2025-03-08 16:19:06,208 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 406 transitions. Word has length 116 [2025-03-08 16:19:06,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:06,208 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 406 transitions. [2025-03-08 16:19:06,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:06,208 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 406 transitions. [2025-03-08 16:19:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:19:06,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:06,209 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:06,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:19:06,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:06,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:06,210 INFO L85 PathProgramCache]: Analyzing trace with hash -6418379, now seen corresponding path program 1 times [2025-03-08 16:19:06,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:06,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284770265] [2025-03-08 16:19:06,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:06,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:06,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:19:06,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:19:06,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:06,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:06,926 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:06,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:06,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284770265] [2025-03-08 16:19:06,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284770265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:06,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:06,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:19:06,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649449584] [2025-03-08 16:19:06,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:06,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:19:06,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:06,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:19:06,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:19:06,928 INFO L87 Difference]: Start difference. First operand 297 states and 406 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:07,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:07,504 INFO L93 Difference]: Finished difference Result 713 states and 979 transitions. [2025-03-08 16:19:07,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:19:07,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2025-03-08 16:19:07,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:07,508 INFO L225 Difference]: With dead ends: 713 [2025-03-08 16:19:07,508 INFO L226 Difference]: Without dead ends: 434 [2025-03-08 16:19:07,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:19:07,510 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 88 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:07,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1041 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:19:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-03-08 16:19:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 430. [2025-03-08 16:19:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 348 states have (on average 1.278735632183908) internal successors, (445), 353 states have internal predecessors, (445), 73 states have call successors, (73), 8 states have call predecessors, (73), 8 states have return successors, (73), 68 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 16:19:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 591 transitions. [2025-03-08 16:19:07,551 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 591 transitions. Word has length 117 [2025-03-08 16:19:07,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:07,551 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 591 transitions. [2025-03-08 16:19:07,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 591 transitions. [2025-03-08 16:19:07,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:19:07,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:07,552 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:07,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:19:07,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:07,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:07,553 INFO L85 PathProgramCache]: Analyzing trace with hash 122664340, now seen corresponding path program 1 times [2025-03-08 16:19:07,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:07,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127416595] [2025-03-08 16:19:07,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:07,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:19:07,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:19:07,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:07,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:08,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:08,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127416595] [2025-03-08 16:19:08,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127416595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:08,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:08,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:19:08,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899526708] [2025-03-08 16:19:08,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:08,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:19:08,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:08,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:19:08,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:19:08,095 INFO L87 Difference]: Start difference. First operand 430 states and 591 transitions. Second operand has 7 states, 5 states have (on average 9.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 16:19:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:08,443 INFO L93 Difference]: Finished difference Result 864 states and 1182 transitions. [2025-03-08 16:19:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:19:08,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 117 [2025-03-08 16:19:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:08,446 INFO L225 Difference]: With dead ends: 864 [2025-03-08 16:19:08,446 INFO L226 Difference]: Without dead ends: 452 [2025-03-08 16:19:08,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:19:08,447 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 80 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:08,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 456 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:19:08,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-08 16:19:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 449. [2025-03-08 16:19:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 360 states have (on average 1.2666666666666666) internal successors, (456), 365 states have internal predecessors, (456), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-08 16:19:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 610 transitions. [2025-03-08 16:19:08,480 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 610 transitions. Word has length 117 [2025-03-08 16:19:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:08,480 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 610 transitions. [2025-03-08 16:19:08,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 16:19:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 610 transitions. [2025-03-08 16:19:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:19:08,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:08,481 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:08,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:19:08,482 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:08,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash 738429625, now seen corresponding path program 1 times [2025-03-08 16:19:08,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:08,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110588194] [2025-03-08 16:19:08,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:08,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:08,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:19:08,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:19:08,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:08,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:08,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:08,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110588194] [2025-03-08 16:19:08,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110588194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:08,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:08,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:19:08,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599611739] [2025-03-08 16:19:08,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:08,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:19:08,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:08,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:19:08,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:19:08,623 INFO L87 Difference]: Start difference. First operand 449 states and 610 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:08,776 INFO L93 Difference]: Finished difference Result 793 states and 1078 transitions. [2025-03-08 16:19:08,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:19:08,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2025-03-08 16:19:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:08,779 INFO L225 Difference]: With dead ends: 793 [2025-03-08 16:19:08,779 INFO L226 Difference]: Without dead ends: 330 [2025-03-08 16:19:08,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:19:08,780 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 106 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:08,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 437 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:19:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-08 16:19:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2025-03-08 16:19:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 257 states have (on average 1.2295719844357977) internal successors, (316), 260 states have internal predecessors, (316), 61 states have call successors, (61), 9 states have call predecessors, (61), 9 states have return successors, (61), 58 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-08 16:19:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 438 transitions. [2025-03-08 16:19:08,808 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 438 transitions. Word has length 117 [2025-03-08 16:19:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:08,809 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 438 transitions. [2025-03-08 16:19:08,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 438 transitions. [2025-03-08 16:19:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:19:08,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:08,814 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:08,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:19:08,814 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:08,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:08,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1003490732, now seen corresponding path program 1 times [2025-03-08 16:19:08,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:08,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549687422] [2025-03-08 16:19:08,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:08,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:08,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:19:08,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:19:08,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:08,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:09,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:09,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549687422] [2025-03-08 16:19:09,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549687422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:09,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:09,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:19:09,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323727175] [2025-03-08 16:19:09,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:09,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:19:09,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:09,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:19:09,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:19:09,281 INFO L87 Difference]: Start difference. First operand 328 states and 438 transitions. Second operand has 7 states, 5 states have (on average 9.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 16:19:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:09,603 INFO L93 Difference]: Finished difference Result 633 states and 844 transitions. [2025-03-08 16:19:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:19:09,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 117 [2025-03-08 16:19:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:09,606 INFO L225 Difference]: With dead ends: 633 [2025-03-08 16:19:09,606 INFO L226 Difference]: Without dead ends: 335 [2025-03-08 16:19:09,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:19:09,607 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 74 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:09,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 597 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:19:09,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-08 16:19:09,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2025-03-08 16:19:09,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 260 states have (on average 1.2230769230769232) internal successors, (318), 263 states have internal predecessors, (318), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 58 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-08 16:19:09,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 440 transitions. [2025-03-08 16:19:09,630 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 440 transitions. Word has length 117 [2025-03-08 16:19:09,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:09,630 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 440 transitions. [2025-03-08 16:19:09,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 16:19:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 440 transitions. [2025-03-08 16:19:09,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:19:09,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:09,631 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:09,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:19:09,631 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:09,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:09,632 INFO L85 PathProgramCache]: Analyzing trace with hash -874408013, now seen corresponding path program 1 times [2025-03-08 16:19:09,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:09,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787134982] [2025-03-08 16:19:09,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:09,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:09,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:19:09,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:19:09,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:09,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:10,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:10,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787134982] [2025-03-08 16:19:10,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787134982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:10,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:10,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:19:10,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752759502] [2025-03-08 16:19:10,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:10,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:19:10,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:10,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:19:10,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:19:10,005 INFO L87 Difference]: Start difference. First operand 332 states and 440 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:10,398 INFO L93 Difference]: Finished difference Result 637 states and 845 transitions. [2025-03-08 16:19:10,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:19:10,399 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2025-03-08 16:19:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:10,403 INFO L225 Difference]: With dead ends: 637 [2025-03-08 16:19:10,404 INFO L226 Difference]: Without dead ends: 335 [2025-03-08 16:19:10,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:19:10,405 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 75 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:10,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1121 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:19:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-08 16:19:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2025-03-08 16:19:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 260 states have (on average 1.2192307692307693) internal successors, (317), 263 states have internal predecessors, (317), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 58 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-08 16:19:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 439 transitions. [2025-03-08 16:19:10,430 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 439 transitions. Word has length 117 [2025-03-08 16:19:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:10,430 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 439 transitions. [2025-03-08 16:19:10,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 439 transitions. [2025-03-08 16:19:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 16:19:10,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:10,432 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:10,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:19:10,432 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:10,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash -384606583, now seen corresponding path program 1 times [2025-03-08 16:19:10,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:10,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143214783] [2025-03-08 16:19:10,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:10,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:10,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 16:19:10,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 16:19:10,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:10,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:10,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:10,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143214783] [2025-03-08 16:19:10,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143214783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:10,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:10,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:19:10,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385884561] [2025-03-08 16:19:10,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:10,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:19:10,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:10,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:19:10,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:19:10,638 INFO L87 Difference]: Start difference. First operand 332 states and 439 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:10,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:10,810 INFO L93 Difference]: Finished difference Result 864 states and 1140 transitions. [2025-03-08 16:19:10,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:19:10,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 118 [2025-03-08 16:19:10,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:10,814 INFO L225 Difference]: With dead ends: 864 [2025-03-08 16:19:10,814 INFO L226 Difference]: Without dead ends: 562 [2025-03-08 16:19:10,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:19:10,816 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 67 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:10,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 587 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:19:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-08 16:19:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 468. [2025-03-08 16:19:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 374 states have (on average 1.2058823529411764) internal successors, (451), 379 states have internal predecessors, (451), 79 states have call successors, (79), 14 states have call predecessors, (79), 14 states have return successors, (79), 74 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-08 16:19:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 609 transitions. [2025-03-08 16:19:10,852 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 609 transitions. Word has length 118 [2025-03-08 16:19:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:10,852 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 609 transitions. [2025-03-08 16:19:10,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:10,853 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 609 transitions. [2025-03-08 16:19:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:19:10,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:10,856 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:10,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:19:10,856 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:10,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:10,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2063231675, now seen corresponding path program 1 times [2025-03-08 16:19:10,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:10,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993887551] [2025-03-08 16:19:10,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:10,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:10,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:19:10,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:19:10,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:10,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:11,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:11,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993887551] [2025-03-08 16:19:11,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993887551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:11,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:11,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:19:11,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452245917] [2025-03-08 16:19:11,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:11,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:19:11,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:11,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:19:11,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:19:11,705 INFO L87 Difference]: Start difference. First operand 468 states and 609 transitions. Second operand has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 16:19:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:12,605 INFO L93 Difference]: Finished difference Result 918 states and 1189 transitions. [2025-03-08 16:19:12,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:19:12,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 119 [2025-03-08 16:19:12,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:12,609 INFO L225 Difference]: With dead ends: 918 [2025-03-08 16:19:12,609 INFO L226 Difference]: Without dead ends: 480 [2025-03-08 16:19:12,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:19:12,611 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 138 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:12,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 935 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:19:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-08 16:19:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2025-03-08 16:19:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 380 states have (on average 1.1973684210526316) internal successors, (455), 385 states have internal predecessors, (455), 79 states have call successors, (79), 16 states have call predecessors, (79), 16 states have return successors, (79), 74 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-08 16:19:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 613 transitions. [2025-03-08 16:19:12,643 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 613 transitions. Word has length 119 [2025-03-08 16:19:12,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:12,643 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 613 transitions. [2025-03-08 16:19:12,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 16:19:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 613 transitions. [2025-03-08 16:19:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 16:19:12,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:12,644 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:12,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:19:12,644 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:12,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash 287808068, now seen corresponding path program 1 times [2025-03-08 16:19:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:12,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697743249] [2025-03-08 16:19:12,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:12,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:12,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 16:19:12,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 16:19:12,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:12,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:13,371 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:19:13,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:13,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697743249] [2025-03-08 16:19:13,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697743249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:19:13,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453591795] [2025-03-08 16:19:13,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:13,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:19:13,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:19:13,373 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-08 16:19:13,375 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-08 16:19:13,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 16:19:14,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 16:19:14,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:14,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:14,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-08 16:19:14,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:19:14,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:14,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 16:19:14,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 5 [2025-03-08 16:19:14,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 16:19:14,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:19:14,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:14,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2025-03-08 16:19:15,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:15,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 52 [2025-03-08 16:19:15,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:15,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 56 [2025-03-08 16:19:16,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:16,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 60 [2025-03-08 16:19:17,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 39 [2025-03-08 16:19:17,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-03-08 16:19:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 235 proven. 158 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 16:19:17,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:19:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:17,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453591795] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:19:17,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:19:17,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 28] total 41 [2025-03-08 16:19:17,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251648842] [2025-03-08 16:19:17,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:17,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:19:17,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:17,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:19:17,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1431, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 16:19:17,835 INFO L87 Difference]: Start difference. First operand 476 states and 613 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:18,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:18,365 INFO L93 Difference]: Finished difference Result 992 states and 1274 transitions. [2025-03-08 16:19:18,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:19:18,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2025-03-08 16:19:18,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:18,368 INFO L225 Difference]: With dead ends: 992 [2025-03-08 16:19:18,368 INFO L226 Difference]: Without dead ends: 546 [2025-03-08 16:19:18,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=226, Invalid=1580, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 16:19:18,370 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 165 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:18,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 451 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:19:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-03-08 16:19:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 540. [2025-03-08 16:19:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 437 states have (on average 1.2036613272311212) internal successors, (526), 444 states have internal predecessors, (526), 83 states have call successors, (83), 19 states have call predecessors, (83), 19 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 16:19:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 692 transitions. [2025-03-08 16:19:18,409 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 692 transitions. Word has length 120 [2025-03-08 16:19:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:18,409 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 692 transitions. [2025-03-08 16:19:18,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 692 transitions. [2025-03-08 16:19:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 16:19:18,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:18,410 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:18,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 16:19:18,614 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,SelfDestructingSolverStorable14 [2025-03-08 16:19:18,614 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:18,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:18,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1671857178, now seen corresponding path program 1 times [2025-03-08 16:19:18,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:18,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63935773] [2025-03-08 16:19:18,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:18,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:18,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 16:19:18,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 16:19:18,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:18,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:19,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:19,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63935773] [2025-03-08 16:19:19,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63935773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:19,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:19,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:19:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834229043] [2025-03-08 16:19:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:19,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:19:19,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:19,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:19:19,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:19:19,064 INFO L87 Difference]: Start difference. First operand 540 states and 692 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:19,257 INFO L93 Difference]: Finished difference Result 574 states and 731 transitions. [2025-03-08 16:19:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:19:19,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2025-03-08 16:19:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:19,260 INFO L225 Difference]: With dead ends: 574 [2025-03-08 16:19:19,260 INFO L226 Difference]: Without dead ends: 572 [2025-03-08 16:19:19,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:19:19,261 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 63 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:19,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 594 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:19:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-08 16:19:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 560. [2025-03-08 16:19:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 460 states have (on average 1.1934782608695653) internal successors, (549), 467 states have internal predecessors, (549), 79 states have call successors, (79), 20 states have call predecessors, (79), 20 states have return successors, (79), 72 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-08 16:19:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 707 transitions. [2025-03-08 16:19:19,294 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 707 transitions. Word has length 120 [2025-03-08 16:19:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:19,294 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 707 transitions. [2025-03-08 16:19:19,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 707 transitions. [2025-03-08 16:19:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 16:19:19,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:19,295 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:19,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:19:19,295 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:19,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:19,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1670933657, now seen corresponding path program 1 times [2025-03-08 16:19:19,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:19,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689590147] [2025-03-08 16:19:19,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:19,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:19,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 16:19:19,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 16:19:19,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:19,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:25,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:25,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689590147] [2025-03-08 16:19:25,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689590147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:25,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:25,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:19:25,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015684725] [2025-03-08 16:19:25,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:25,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:19:25,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:25,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:19:25,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:19:25,381 INFO L87 Difference]: Start difference. First operand 560 states and 707 transitions. Second operand has 14 states, 11 states have (on average 4.363636363636363) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 16:19:31,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:19:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:35,849 INFO L93 Difference]: Finished difference Result 1636 states and 2067 transitions. [2025-03-08 16:19:35,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 16:19:35,850 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.363636363636363) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 120 [2025-03-08 16:19:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:35,854 INFO L225 Difference]: With dead ends: 1636 [2025-03-08 16:19:35,854 INFO L226 Difference]: Without dead ends: 1098 [2025-03-08 16:19:35,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:19:35,856 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 210 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 36 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:35,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 906 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 915 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2025-03-08 16:19:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2025-03-08 16:19:35,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 714. [2025-03-08 16:19:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 614 states have (on average 1.216612377850163) internal successors, (747), 621 states have internal predecessors, (747), 79 states have call successors, (79), 20 states have call predecessors, (79), 20 states have return successors, (79), 72 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-08 16:19:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 905 transitions. [2025-03-08 16:19:35,905 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 905 transitions. Word has length 120 [2025-03-08 16:19:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:35,905 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 905 transitions. [2025-03-08 16:19:35,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.363636363636363) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 16:19:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 905 transitions. [2025-03-08 16:19:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 16:19:35,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:35,906 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:35,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:19:35,907 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:35,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:35,907 INFO L85 PathProgramCache]: Analyzing trace with hash -150314654, now seen corresponding path program 1 times [2025-03-08 16:19:35,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:35,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997457837] [2025-03-08 16:19:35,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:35,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:35,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 16:19:35,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 16:19:35,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:35,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:36,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:36,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997457837] [2025-03-08 16:19:36,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997457837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:36,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:36,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:19:36,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384893772] [2025-03-08 16:19:36,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:36,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:19:36,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:36,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:19:36,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:19:36,757 INFO L87 Difference]: Start difference. First operand 714 states and 905 transitions. Second operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 16:19:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:37,923 INFO L93 Difference]: Finished difference Result 1356 states and 1698 transitions. [2025-03-08 16:19:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 16:19:37,923 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 121 [2025-03-08 16:19:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:37,926 INFO L225 Difference]: With dead ends: 1356 [2025-03-08 16:19:37,926 INFO L226 Difference]: Without dead ends: 664 [2025-03-08 16:19:37,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:19:37,928 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 178 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:37,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 986 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:19:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-08 16:19:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 590. [2025-03-08 16:19:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 499 states have (on average 1.1803607214428857) internal successors, (589), 503 states have internal predecessors, (589), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 16:19:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 729 transitions. [2025-03-08 16:19:37,977 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 729 transitions. Word has length 121 [2025-03-08 16:19:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:37,977 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 729 transitions. [2025-03-08 16:19:37,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 16:19:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 729 transitions. [2025-03-08 16:19:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 16:19:37,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:37,979 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:37,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:19:37,979 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:37,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:37,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1569073601, now seen corresponding path program 1 times [2025-03-08 16:19:37,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:37,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155443747] [2025-03-08 16:19:37,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:37,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:37,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 16:19:38,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 16:19:38,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:38,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:38,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:38,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155443747] [2025-03-08 16:19:38,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155443747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:38,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:38,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:19:38,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237468590] [2025-03-08 16:19:38,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:38,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:19:38,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:38,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:19:38,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:19:38,475 INFO L87 Difference]: Start difference. First operand 590 states and 729 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:38,784 INFO L93 Difference]: Finished difference Result 1226 states and 1501 transitions. [2025-03-08 16:19:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:19:38,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2025-03-08 16:19:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:38,787 INFO L225 Difference]: With dead ends: 1226 [2025-03-08 16:19:38,787 INFO L226 Difference]: Without dead ends: 639 [2025-03-08 16:19:38,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:19:38,789 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 53 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:38,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 521 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:19:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-03-08 16:19:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 566. [2025-03-08 16:19:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 475 states have (on average 1.16) internal successors, (551), 479 states have internal predecessors, (551), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 16:19:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 691 transitions. [2025-03-08 16:19:38,857 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 691 transitions. Word has length 121 [2025-03-08 16:19:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:38,857 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 691 transitions. [2025-03-08 16:19:38,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 691 transitions. [2025-03-08 16:19:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:19:38,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:38,859 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:38,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:19:38,859 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:38,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:38,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1766203098, now seen corresponding path program 1 times [2025-03-08 16:19:38,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:38,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342819950] [2025-03-08 16:19:38,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:38,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:19:38,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:19:38,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:38,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:39,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:39,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342819950] [2025-03-08 16:19:39,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342819950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:39,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:39,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:19:39,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085950187] [2025-03-08 16:19:39,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:39,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:19:39,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:39,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:19:39,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:19:39,147 INFO L87 Difference]: Start difference. First operand 566 states and 691 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:39,332 INFO L93 Difference]: Finished difference Result 1403 states and 1706 transitions. [2025-03-08 16:19:39,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:19:39,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-08 16:19:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:39,335 INFO L225 Difference]: With dead ends: 1403 [2025-03-08 16:19:39,336 INFO L226 Difference]: Without dead ends: 840 [2025-03-08 16:19:39,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:19:39,337 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 55 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:39,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 753 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:19:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-03-08 16:19:39,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 641. [2025-03-08 16:19:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 550 states have (on average 1.16) internal successors, (638), 554 states have internal predecessors, (638), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 16:19:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 778 transitions. [2025-03-08 16:19:39,386 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 778 transitions. Word has length 122 [2025-03-08 16:19:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:39,386 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 778 transitions. [2025-03-08 16:19:39,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 778 transitions. [2025-03-08 16:19:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:19:39,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:39,387 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:39,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:19:39,388 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:39,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:39,389 INFO L85 PathProgramCache]: Analyzing trace with hash 590563691, now seen corresponding path program 1 times [2025-03-08 16:19:39,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:39,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812119577] [2025-03-08 16:19:39,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:39,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:39,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:19:39,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:19:39,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:39,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:39,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:39,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812119577] [2025-03-08 16:19:39,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812119577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:39,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:39,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:19:39,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817520087] [2025-03-08 16:19:39,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:39,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:19:39,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:39,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:19:39,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:19:39,672 INFO L87 Difference]: Start difference. First operand 641 states and 778 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:39,888 INFO L93 Difference]: Finished difference Result 1435 states and 1742 transitions. [2025-03-08 16:19:39,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:19:39,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-03-08 16:19:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:39,891 INFO L225 Difference]: With dead ends: 1435 [2025-03-08 16:19:39,891 INFO L226 Difference]: Without dead ends: 797 [2025-03-08 16:19:39,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:19:39,893 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 47 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:39,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 521 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:19:39,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-03-08 16:19:39,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 647. [2025-03-08 16:19:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 556 states have (on average 1.158273381294964) internal successors, (644), 560 states have internal predecessors, (644), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 16:19:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 784 transitions. [2025-03-08 16:19:39,953 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 784 transitions. Word has length 127 [2025-03-08 16:19:39,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:39,954 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 784 transitions. [2025-03-08 16:19:39,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 784 transitions. [2025-03-08 16:19:39,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:19:39,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:39,955 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:39,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:19:39,955 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:39,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:39,956 INFO L85 PathProgramCache]: Analyzing trace with hash 719646410, now seen corresponding path program 1 times [2025-03-08 16:19:39,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:39,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608377604] [2025-03-08 16:19:39,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:39,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:39,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:19:39,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:19:39,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:39,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:40,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:40,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608377604] [2025-03-08 16:19:40,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608377604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:40,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:40,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:19:40,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508137399] [2025-03-08 16:19:40,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:40,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:19:40,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:40,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:19:40,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:19:40,130 INFO L87 Difference]: Start difference. First operand 647 states and 784 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:40,226 INFO L93 Difference]: Finished difference Result 1403 states and 1694 transitions. [2025-03-08 16:19:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:19:40,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-03-08 16:19:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:40,229 INFO L225 Difference]: With dead ends: 1403 [2025-03-08 16:19:40,230 INFO L226 Difference]: Without dead ends: 759 [2025-03-08 16:19:40,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:19:40,232 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 37 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:40,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 670 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:19:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-03-08 16:19:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 641. [2025-03-08 16:19:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 550 states have (on average 1.1381818181818182) internal successors, (626), 554 states have internal predecessors, (626), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 16:19:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 766 transitions. [2025-03-08 16:19:40,281 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 766 transitions. Word has length 127 [2025-03-08 16:19:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:40,282 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 766 transitions. [2025-03-08 16:19:40,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 766 transitions. [2025-03-08 16:19:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:19:40,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:40,283 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:40,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:19:40,283 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:40,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:40,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1066568907, now seen corresponding path program 1 times [2025-03-08 16:19:40,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:40,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128351278] [2025-03-08 16:19:40,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:40,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:40,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:19:40,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:19:40,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:40,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:40,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:40,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128351278] [2025-03-08 16:19:40,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128351278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:40,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:40,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:19:40,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034399257] [2025-03-08 16:19:40,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:40,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:19:40,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:40,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:19:40,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:19:40,640 INFO L87 Difference]: Start difference. First operand 641 states and 766 transitions. Second operand has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:40,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:40,932 INFO L93 Difference]: Finished difference Result 1336 states and 1590 transitions. [2025-03-08 16:19:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:19:40,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-03-08 16:19:40,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:40,935 INFO L225 Difference]: With dead ends: 1336 [2025-03-08 16:19:40,935 INFO L226 Difference]: Without dead ends: 698 [2025-03-08 16:19:40,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:19:40,936 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 33 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:40,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 521 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:19:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-08 16:19:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 641. [2025-03-08 16:19:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 550 states have (on average 1.1272727272727272) internal successors, (620), 554 states have internal predecessors, (620), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 16:19:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 760 transitions. [2025-03-08 16:19:40,983 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 760 transitions. Word has length 127 [2025-03-08 16:19:40,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:40,983 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 760 transitions. [2025-03-08 16:19:40,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:19:40,983 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 760 transitions. [2025-03-08 16:19:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 16:19:40,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:40,984 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:40,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:19:40,984 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:40,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:40,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2072475738, now seen corresponding path program 1 times [2025-03-08 16:19:40,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:40,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101406328] [2025-03-08 16:19:40,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:40,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:40,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 16:19:41,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 16:19:41,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:41,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:41,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:41,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101406328] [2025-03-08 16:19:41,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101406328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:41,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:41,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:19:41,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454859285] [2025-03-08 16:19:41,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:41,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:19:41,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:41,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:19:41,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:19:41,216 INFO L87 Difference]: Start difference. First operand 641 states and 760 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:41,523 INFO L93 Difference]: Finished difference Result 1631 states and 1930 transitions. [2025-03-08 16:19:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:19:41,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-08 16:19:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:41,527 INFO L225 Difference]: With dead ends: 1631 [2025-03-08 16:19:41,527 INFO L226 Difference]: Without dead ends: 993 [2025-03-08 16:19:41,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:19:41,528 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 76 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:41,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 514 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:19:41,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2025-03-08 16:19:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 667. [2025-03-08 16:19:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 576 states have (on average 1.1215277777777777) internal successors, (646), 580 states have internal predecessors, (646), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 16:19:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 786 transitions. [2025-03-08 16:19:41,591 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 786 transitions. Word has length 132 [2025-03-08 16:19:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:41,591 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 786 transitions. [2025-03-08 16:19:41,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 786 transitions. [2025-03-08 16:19:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 16:19:41,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:41,592 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:41,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:19:41,593 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:41,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1260877541, now seen corresponding path program 1 times [2025-03-08 16:19:41,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:41,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119430742] [2025-03-08 16:19:41,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:41,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:41,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 16:19:41,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 16:19:41,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:41,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:43,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:43,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119430742] [2025-03-08 16:19:43,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119430742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:43,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:43,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-08 16:19:43,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200285348] [2025-03-08 16:19:43,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:43,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 16:19:43,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:43,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 16:19:43,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:19:43,367 INFO L87 Difference]: Start difference. First operand 667 states and 786 transitions. Second operand has 24 states, 21 states have (on average 2.857142857142857) internal successors, (60), 24 states have internal predecessors, (60), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 16:19:51,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:51,663 INFO L93 Difference]: Finished difference Result 1566 states and 1840 transitions. [2025-03-08 16:19:51,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 16:19:51,665 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.857142857142857) internal successors, (60), 24 states have internal predecessors, (60), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 132 [2025-03-08 16:19:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:51,668 INFO L225 Difference]: With dead ends: 1566 [2025-03-08 16:19:51,668 INFO L226 Difference]: Without dead ends: 902 [2025-03-08 16:19:51,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=183, Invalid=1377, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 16:19:51,669 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 264 mSDsluCounter, 2427 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 2606 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:51,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 2606 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-03-08 16:19:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2025-03-08 16:19:51,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 738. [2025-03-08 16:19:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 647 states have (on average 1.1267387944358578) internal successors, (729), 651 states have internal predecessors, (729), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 16:19:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 869 transitions. [2025-03-08 16:19:51,725 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 869 transitions. Word has length 132 [2025-03-08 16:19:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:51,726 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 869 transitions. [2025-03-08 16:19:51,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.857142857142857) internal successors, (60), 24 states have internal predecessors, (60), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 16:19:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 869 transitions. [2025-03-08 16:19:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 16:19:51,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:51,727 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:51,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:19:51,727 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:51,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:51,728 INFO L85 PathProgramCache]: Analyzing trace with hash 967474534, now seen corresponding path program 1 times [2025-03-08 16:19:51,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:51,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563435044] [2025-03-08 16:19:51,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:51,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:51,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 16:19:51,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 16:19:51,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:51,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:51,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:51,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563435044] [2025-03-08 16:19:51,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563435044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:51,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:51,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:19:51,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57394478] [2025-03-08 16:19:51,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:51,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:19:51,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:51,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:19:51,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:19:51,921 INFO L87 Difference]: Start difference. First operand 738 states and 869 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:52,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:52,286 INFO L93 Difference]: Finished difference Result 1831 states and 2150 transitions. [2025-03-08 16:19:52,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:19:52,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-08 16:19:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:52,290 INFO L225 Difference]: With dead ends: 1831 [2025-03-08 16:19:52,291 INFO L226 Difference]: Without dead ends: 1096 [2025-03-08 16:19:52,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:19:52,292 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 61 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:52,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 532 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:19:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2025-03-08 16:19:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 785. [2025-03-08 16:19:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 694 states have (on average 1.1181556195965419) internal successors, (776), 698 states have internal predecessors, (776), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 16:19:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 916 transitions. [2025-03-08 16:19:52,355 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 916 transitions. Word has length 132 [2025-03-08 16:19:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:52,355 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 916 transitions. [2025-03-08 16:19:52,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 916 transitions. [2025-03-08 16:19:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 16:19:52,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:52,357 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:52,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:19:52,358 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:52,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:52,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1379374041, now seen corresponding path program 1 times [2025-03-08 16:19:52,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:52,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593032955] [2025-03-08 16:19:52,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:52,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 16:19:52,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 16:19:52,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:52,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:52,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:52,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593032955] [2025-03-08 16:19:52,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593032955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:52,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:52,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:19:52,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665602719] [2025-03-08 16:19:52,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:52,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:19:52,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:52,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:19:52,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:19:52,485 INFO L87 Difference]: Start difference. First operand 785 states and 916 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:52,693 INFO L93 Difference]: Finished difference Result 1477 states and 1721 transitions. [2025-03-08 16:19:52,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:19:52,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-08 16:19:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:52,696 INFO L225 Difference]: With dead ends: 1477 [2025-03-08 16:19:52,696 INFO L226 Difference]: Without dead ends: 695 [2025-03-08 16:19:52,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:19:52,699 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 97 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:52,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 510 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:19:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-03-08 16:19:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2025-03-08 16:19:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 602 states have (on average 1.101328903654485) internal successors, (663), 606 states have internal predecessors, (663), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 16:19:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 803 transitions. [2025-03-08 16:19:52,758 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 803 transitions. Word has length 132 [2025-03-08 16:19:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:52,759 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 803 transitions. [2025-03-08 16:19:52,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:19:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 803 transitions. [2025-03-08 16:19:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 16:19:52,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:52,761 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:52,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 16:19:52,761 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:52,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1334111621, now seen corresponding path program 1 times [2025-03-08 16:19:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:52,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798854276] [2025-03-08 16:19:52,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:52,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 16:19:52,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 16:19:52,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:52,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:19:54,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:54,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798854276] [2025-03-08 16:19:54,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798854276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:54,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:54,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 16:19:54,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14638265] [2025-03-08 16:19:54,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:54,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 16:19:54,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:54,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 16:19:54,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:19:54,599 INFO L87 Difference]: Start difference. First operand 693 states and 803 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 16:19:57,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:57,485 INFO L93 Difference]: Finished difference Result 1522 states and 1760 transitions. [2025-03-08 16:19:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 16:19:57,486 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2025-03-08 16:19:57,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:57,489 INFO L225 Difference]: With dead ends: 1522 [2025-03-08 16:19:57,489 INFO L226 Difference]: Without dead ends: 832 [2025-03-08 16:19:57,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=137, Invalid=855, Unknown=0, NotChecked=0, Total=992 [2025-03-08 16:19:57,490 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 154 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 2322 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:57,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 2322 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1942 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 16:19:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-08 16:19:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 574. [2025-03-08 16:19:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 505 states have (on average 1.106930693069307) internal successors, (559), 507 states have internal predecessors, (559), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:19:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 663 transitions. [2025-03-08 16:19:57,547 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 663 transitions. Word has length 132 [2025-03-08 16:19:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:57,547 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 663 transitions. [2025-03-08 16:19:57,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 16:19:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 663 transitions. [2025-03-08 16:19:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:19:57,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:57,548 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:57,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 16:19:57,548 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:57,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1274785858, now seen corresponding path program 1 times [2025-03-08 16:19:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:57,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887292470] [2025-03-08 16:19:57,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:57,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:19:57,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:19:57,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:57,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat