./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.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-12.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 6426d30449276f41292d944281f990de88775c0c256461a4ce5af87d5d4d093f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:13:26,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:13:26,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:13:26,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:13:26,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:13:26,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:13:26,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:13:26,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:13:26,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:13:26,457 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:13:26,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:13:26,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:13:26,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:13:26,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:13:26,459 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:13:26,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:13:26,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:13:26,459 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:13:26,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:13:26,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:13:26,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:13:26,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:13:26,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:13:26,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:13:26,460 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:13:26,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:13:26,460 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:13:26,460 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:13:26,460 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:13:26,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:13:26,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:13:26,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:13:26,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:13:26,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:13:26,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:13:26,461 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:13:26,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:13:26,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:13:26,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:13:26,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:13:26,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:13:26,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:13:26,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:13:26,462 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 -> 6426d30449276f41292d944281f990de88775c0c256461a4ce5af87d5d4d093f [2025-03-08 16:13:26,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:13:26,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:13:26,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:13:26,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:13:26,702 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:13:26,703 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-12.i [2025-03-08 16:13:27,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a12d7bb6/2b4b41ccc0514be9ac9a96f53756713a/FLAG30dac3c64 [2025-03-08 16:13:28,042 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:13:28,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i [2025-03-08 16:13:28,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a12d7bb6/2b4b41ccc0514be9ac9a96f53756713a/FLAG30dac3c64 [2025-03-08 16:13:28,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a12d7bb6/2b4b41ccc0514be9ac9a96f53756713a [2025-03-08 16:13:28,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:13:28,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:13:28,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:13:28,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:13:28,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:13:28,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:13:28" (1/1) ... [2025-03-08 16:13:28,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a3954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:28, skipping insertion in model container [2025-03-08 16:13:28,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:13:28" (1/1) ... [2025-03-08 16:13:28,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:13:28,188 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-12.i[916,929] [2025-03-08 16:13:28,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:13:28,264 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:13:28,272 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-12.i[916,929] [2025-03-08 16:13:28,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:13:28,326 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:13:28,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:28 WrapperNode [2025-03-08 16:13:28,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:13:28,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:13:28,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:13:28,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:13:28,332 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:13:28" (1/1) ... [2025-03-08 16:13:28,346 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:13:28" (1/1) ... [2025-03-08 16:13:28,386 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 444 [2025-03-08 16:13:28,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:13:28,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:13:28,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:13:28,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:13:28,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:28" (1/1) ... [2025-03-08 16:13:28,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:28" (1/1) ... [2025-03-08 16:13:28,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:28" (1/1) ... [2025-03-08 16:13:28,422 INFO L175 MemorySlicer]: Split 123 memory accesses to 4 slices as follows [2, 38, 12, 71]. 58 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 2, 4]. The 14 writes are split as follows [0, 8, 2, 4]. [2025-03-08 16:13:28,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:28" (1/1) ... [2025-03-08 16:13:28,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:28" (1/1) ... [2025-03-08 16:13:28,442 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:28" (1/1) ... [2025-03-08 16:13:28,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:28" (1/1) ... [2025-03-08 16:13:28,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:28" (1/1) ... [2025-03-08 16:13:28,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:28" (1/1) ... [2025-03-08 16:13:28,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:13:28,455 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:13:28,459 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:13:28,460 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:13:28,460 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:28" (1/1) ... [2025-03-08 16:13:28,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:13:28,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:28,490 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:13:28,496 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:13:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:13:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:13:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:13:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:13:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:13:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:13:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:13:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:13:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:13:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:13:28,514 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:13:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:13:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:13:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:13:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:13:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:13:28,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:13:28,605 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:13:28,607 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:13:28,928 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~mem71#1;havoc property_#t~ite82#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite81#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem79#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite103#1;havoc property_#t~mem96#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem102#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~short106#1;havoc property_#t~mem109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem110#1;havoc property_#t~ite126#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite123#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short117#1;havoc property_#t~short119#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short127#1; [2025-03-08 16:13:28,948 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-03-08 16:13:28,948 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:13:28,955 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:13:28,955 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:13:28,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:13:28 BoogieIcfgContainer [2025-03-08 16:13:28,955 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:13:28,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:13:28,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:13:28,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:13:28,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:13:28" (1/3) ... [2025-03-08 16:13:28,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f18b1dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:13:28, skipping insertion in model container [2025-03-08 16:13:28,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:28" (2/3) ... [2025-03-08 16:13:28,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f18b1dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:13:28, skipping insertion in model container [2025-03-08 16:13:28,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:13:28" (3/3) ... [2025-03-08 16:13:28,962 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-12.i [2025-03-08 16:13:28,972 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:13:28,973 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-12.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:13:29,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:13:29,024 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;@770a9489, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:13:29,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:13:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:13:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:13:29,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:29,035 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:29,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:29,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:29,039 INFO L85 PathProgramCache]: Analyzing trace with hash 825168545, now seen corresponding path program 1 times [2025-03-08 16:13:29,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:29,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016179794] [2025-03-08 16:13:29,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:29,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:29,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:13:29,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:13:29,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:29,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 16:13:29,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:29,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016179794] [2025-03-08 16:13:29,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016179794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:13:29,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860458361] [2025-03-08 16:13:29,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:29,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:29,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:29,279 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:13:29,281 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:13:29,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:13:29,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:13:29,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:29,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:29,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:13:29,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:13:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 16:13:29,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:13:29,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860458361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:29,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:13:29,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:13:29,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821349225] [2025-03-08 16:13:29,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:29,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:13:29,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:29,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:13:29,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:13:29,472 INFO L87 Difference]: Start difference. First operand has 97 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:13:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:29,487 INFO L93 Difference]: Finished difference Result 182 states and 281 transitions. [2025-03-08 16:13:29,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:13:29,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 117 [2025-03-08 16:13:29,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:29,493 INFO L225 Difference]: With dead ends: 182 [2025-03-08 16:13:29,493 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 16:13:29,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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:13:29,498 INFO L435 NwaCegarLoop]: 123 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, 123 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:13:29,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 16:13:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-08 16:13:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:13:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2025-03-08 16:13:29,530 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 117 [2025-03-08 16:13:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2025-03-08 16:13:29,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:13:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2025-03-08 16:13:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:13:29,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:29,534 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:29,543 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:13:29,735 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:13:29,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:29,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:29,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1491333777, now seen corresponding path program 1 times [2025-03-08 16:13:29,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:29,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161325758] [2025-03-08 16:13:29,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:29,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:29,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:13:29,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:13:29,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:29,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 16:13:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161325758] [2025-03-08 16:13:30,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161325758] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:13:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295838027] [2025-03-08 16:13:30,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:30,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:30,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:30,070 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:13:30,071 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:13:30,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:13:30,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:13:30,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:30,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:30,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:13:30,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:13:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:30,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:13:30,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295838027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:30,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:13:30,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-08 16:13:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089919695] [2025-03-08 16:13:30,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:30,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:13:30,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:30,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:13:30,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:30,240 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:13:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:30,272 INFO L93 Difference]: Finished difference Result 173 states and 243 transitions. [2025-03-08 16:13:30,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:13:30,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2025-03-08 16:13:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:30,276 INFO L225 Difference]: With dead ends: 173 [2025-03-08 16:13:30,276 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 16:13:30,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 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:13:30,277 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:30,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 16:13:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-08 16:13:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:13:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2025-03-08 16:13:30,290 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 117 [2025-03-08 16:13:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:30,291 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2025-03-08 16:13:30,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:13:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2025-03-08 16:13:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:13:30,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:30,294 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:30,300 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:13:30,494 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,SelfDestructingSolverStorable1 [2025-03-08 16:13:30,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:30,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1309974883, now seen corresponding path program 1 times [2025-03-08 16:13:30,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:30,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56848696] [2025-03-08 16:13:30,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:30,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:30,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:13:30,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:13:30,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:30,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 16:13:30,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:30,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56848696] [2025-03-08 16:13:30,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56848696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:13:30,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694776579] [2025-03-08 16:13:30,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:30,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:30,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:30,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:13:30,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:13:30,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:13:30,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:13:30,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:30,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:30,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:13:30,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:13:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:30,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:13:30,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694776579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:30,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:13:30,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:13:30,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930567159] [2025-03-08 16:13:30,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:30,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:13:30,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:30,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:13:30,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:13:30,861 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:13:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:30,898 INFO L93 Difference]: Finished difference Result 176 states and 245 transitions. [2025-03-08 16:13:30,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:13:30,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-03-08 16:13:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:30,899 INFO L225 Difference]: With dead ends: 176 [2025-03-08 16:13:30,900 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 16:13:30,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:13:30,900 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:30,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 461 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:30,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 16:13:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 16:13:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:13:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2025-03-08 16:13:30,912 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 119 [2025-03-08 16:13:30,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:30,914 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2025-03-08 16:13:30,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:13:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2025-03-08 16:13:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 16:13:30,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:30,915 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:30,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 16:13:31,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:31,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:31,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash -79662761, now seen corresponding path program 1 times [2025-03-08 16:13:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:31,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95427412] [2025-03-08 16:13:31,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:31,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:31,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 16:13:31,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 16:13:31,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:31,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:32,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:32,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95427412] [2025-03-08 16:13:32,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95427412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:32,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:32,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:13:32,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968139472] [2025-03-08 16:13:32,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:32,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:13:32,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:32,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:13:32,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:13:32,206 INFO L87 Difference]: Start difference. First operand 91 states and 125 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:13:32,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:32,377 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2025-03-08 16:13:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:13:32,378 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 121 [2025-03-08 16:13:32,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:32,380 INFO L225 Difference]: With dead ends: 133 [2025-03-08 16:13:32,381 INFO L226 Difference]: Without dead ends: 131 [2025-03-08 16:13:32,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:13:32,382 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 36 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:32,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 767 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-08 16:13:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2025-03-08 16:13:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 98 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:13:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2025-03-08 16:13:32,390 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 121 [2025-03-08 16:13:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:32,391 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2025-03-08 16:13:32,391 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:13:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2025-03-08 16:13:32,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:13:32,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:32,395 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:32,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:13:32,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:32,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:32,395 INFO L85 PathProgramCache]: Analyzing trace with hash 939240366, now seen corresponding path program 1 times [2025-03-08 16:13:32,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:32,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164762350] [2025-03-08 16:13:32,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:32,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:32,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:13:32,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:13:32,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:32,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-08 16:13:34,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:34,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164762350] [2025-03-08 16:13:34,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164762350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:13:34,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063409570] [2025-03-08 16:13:34,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:34,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:34,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:34,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:13:34,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:13:34,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:13:34,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:13:34,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:34,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:34,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-08 16:13:34,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:13:34,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-08 16:13:34,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2025-03-08 16:13:34,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:13:34,926 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 49 treesize of output 39 [2025-03-08 16:13:35,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:13:35,525 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 49 treesize of output 39 [2025-03-08 16:13:35,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:13:35,667 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 68 treesize of output 34 [2025-03-08 16:13:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 32 proven. 184 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:35,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:13:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-08 16:13:36,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063409570] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:13:36,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:13:36,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 23] total 58 [2025-03-08 16:13:36,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476730146] [2025-03-08 16:13:36,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:13:36,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-08 16:13:36,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:36,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-08 16:13:36,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=2843, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 16:13:36,739 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 58 states, 46 states have (on average 3.3260869565217392) internal successors, (153), 48 states have internal predecessors, (153), 15 states have call successors, (48), 6 states have call predecessors, (48), 11 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48) [2025-03-08 16:13:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:39,371 INFO L93 Difference]: Finished difference Result 263 states and 333 transitions. [2025-03-08 16:13:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-08 16:13:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 46 states have (on average 3.3260869565217392) internal successors, (153), 48 states have internal predecessors, (153), 15 states have call successors, (48), 6 states have call predecessors, (48), 11 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48) Word has length 122 [2025-03-08 16:13:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:39,373 INFO L225 Difference]: With dead ends: 263 [2025-03-08 16:13:39,374 INFO L226 Difference]: Without dead ends: 261 [2025-03-08 16:13:39,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 214 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3579 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1770, Invalid=10440, Unknown=0, NotChecked=0, Total=12210 [2025-03-08 16:13:39,379 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1513 mSDsluCounter, 2267 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:39,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 2385 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 16:13:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-08 16:13:39,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 132. [2025-03-08 16:13:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.2454545454545454) internal successors, (137), 110 states have internal predecessors, (137), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:13:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 169 transitions. [2025-03-08 16:13:39,401 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 169 transitions. Word has length 122 [2025-03-08 16:13:39,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:39,402 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 169 transitions. [2025-03-08 16:13:39,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 46 states have (on average 3.3260869565217392) internal successors, (153), 48 states have internal predecessors, (153), 15 states have call successors, (48), 6 states have call predecessors, (48), 11 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48) [2025-03-08 16:13:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 169 transitions. [2025-03-08 16:13:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 16:13:39,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:39,403 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:39,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 16:13:39,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:39,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:39,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:39,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1530609216, now seen corresponding path program 1 times [2025-03-08 16:13:39,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:39,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706191821] [2025-03-08 16:13:39,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:39,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:39,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:13:39,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:13:39,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:39,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-08 16:13:40,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:40,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706191821] [2025-03-08 16:13:40,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706191821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:13:40,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17311968] [2025-03-08 16:13:40,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:40,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:40,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:40,974 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:13:40,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 16:13:41,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:13:41,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:13:41,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:41,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:41,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-08 16:13:41,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:13:41,095 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 9 treesize of output 3 [2025-03-08 16:13:41,226 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 29 treesize of output 13 [2025-03-08 16:13:41,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:13:41,483 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 40 treesize of output 27 [2025-03-08 16:13:41,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:13:41,757 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 38 treesize of output 36 [2025-03-08 16:13:41,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:13:41,917 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 66 treesize of output 34 [2025-03-08 16:13:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 144 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:41,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:13:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-08 16:13:42,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17311968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:13:42,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:13:42,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26, 26] total 58 [2025-03-08 16:13:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399198082] [2025-03-08 16:13:42,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:13:42,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-08 16:13:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:42,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-08 16:13:42,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=2856, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 16:13:42,686 INFO L87 Difference]: Start difference. First operand 132 states and 169 transitions. Second operand has 58 states, 46 states have (on average 3.239130434782609) internal successors, (149), 51 states have internal predecessors, (149), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48) [2025-03-08 16:13:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:44,792 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2025-03-08 16:13:44,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-08 16:13:44,793 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 46 states have (on average 3.239130434782609) internal successors, (149), 51 states have internal predecessors, (149), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48) Word has length 123 [2025-03-08 16:13:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:44,794 INFO L225 Difference]: With dead ends: 213 [2025-03-08 16:13:44,794 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 16:13:44,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 216 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2780 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1557, Invalid=8343, Unknown=0, NotChecked=0, Total=9900 [2025-03-08 16:13:44,796 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 1222 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:44,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 2053 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:13:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 16:13:44,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 134. [2025-03-08 16:13:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.25) internal successors, (140), 112 states have internal predecessors, (140), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:13:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2025-03-08 16:13:44,812 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 123 [2025-03-08 16:13:44,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:44,812 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2025-03-08 16:13:44,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 46 states have (on average 3.239130434782609) internal successors, (149), 51 states have internal predecessors, (149), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48) [2025-03-08 16:13:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2025-03-08 16:13:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:13:44,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:44,813 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:44,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 16:13:45,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:45,014 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:45,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:45,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1807300440, now seen corresponding path program 1 times [2025-03-08 16:13:45,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:45,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196521963] [2025-03-08 16:13:45,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:45,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:45,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:13:45,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:13:45,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:45,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 16:13:45,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:45,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196521963] [2025-03-08 16:13:45,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196521963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:13:45,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599477886] [2025-03-08 16:13:45,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:45,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:45,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:45,270 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:13:45,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 16:13:45,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:13:45,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:13:45,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:45,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:45,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 16:13:45,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:13:45,509 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 41 treesize of output 23 [2025-03-08 16:13:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-08 16:13:45,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:13:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 16:13:45,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599477886] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:13:45,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:13:45,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2025-03-08 16:13:45,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780544798] [2025-03-08 16:13:45,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:13:45,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:13:45,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:45,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:13:45,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:13:45,683 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-08 16:13:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:45,968 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2025-03-08 16:13:45,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:13:45,969 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) Word has length 124 [2025-03-08 16:13:45,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:45,970 INFO L225 Difference]: With dead ends: 273 [2025-03-08 16:13:45,970 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 16:13:45,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:13:45,971 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 150 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:45,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 423 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:13:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 16:13:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2025-03-08 16:13:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 115 states have internal predecessors, (142), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:13:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions. [2025-03-08 16:13:45,989 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 124 [2025-03-08 16:13:45,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:45,989 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 174 transitions. [2025-03-08 16:13:45,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-08 16:13:45,989 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions. [2025-03-08 16:13:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:13:45,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:45,990 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:45,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 16:13:46,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:46,191 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:46,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:46,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1805566955, now seen corresponding path program 1 times [2025-03-08 16:13:46,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:46,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839567596] [2025-03-08 16:13:46,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:46,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:46,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:13:46,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:13:46,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:46,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:46,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:46,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839567596] [2025-03-08 16:13:46,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839567596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:46,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:46,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:13:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748316436] [2025-03-08 16:13:46,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:46,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:13:46,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:46,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:13:46,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:13:46,267 INFO L87 Difference]: Start difference. First operand 138 states and 174 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:13:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:46,325 INFO L93 Difference]: Finished difference Result 355 states and 439 transitions. [2025-03-08 16:13:46,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:13:46,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2025-03-08 16:13:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:46,328 INFO L225 Difference]: With dead ends: 355 [2025-03-08 16:13:46,328 INFO L226 Difference]: Without dead ends: 220 [2025-03-08 16:13:46,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:46,329 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 53 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:46,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 506 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-08 16:13:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 159. [2025-03-08 16:13:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 136 states have (on average 1.2205882352941178) internal successors, (166), 136 states have internal predecessors, (166), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:13:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 198 transitions. [2025-03-08 16:13:46,343 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 198 transitions. Word has length 124 [2025-03-08 16:13:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:46,343 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 198 transitions. [2025-03-08 16:13:46,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:13:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 198 transitions. [2025-03-08 16:13:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:13:46,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:46,347 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:46,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:13:46,347 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:46,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:46,347 INFO L85 PathProgramCache]: Analyzing trace with hash -821114822, now seen corresponding path program 1 times [2025-03-08 16:13:46,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:46,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307553216] [2025-03-08 16:13:46,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:46,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:13:46,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:13:46,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:46,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 16:13:46,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:46,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307553216] [2025-03-08 16:13:46,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307553216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:13:46,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255299645] [2025-03-08 16:13:46,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:46,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:46,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:46,660 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:13:46,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 16:13:46,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:13:46,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:13:46,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:46,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:46,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 16:13:46,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:13:46,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:13:46,890 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 29 treesize of output 31 [2025-03-08 16:13:46,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:13:46,942 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 54 treesize of output 26 [2025-03-08 16:13:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-08 16:13:46,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:13:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 16:13:47,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255299645] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:13:47,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:13:47,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2025-03-08 16:13:47,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049351613] [2025-03-08 16:13:47,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:13:47,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:13:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:47,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:13:47,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:13:47,105 INFO L87 Difference]: Start difference. First operand 159 states and 198 transitions. Second operand has 13 states, 10 states have (on average 8.1) internal successors, (81), 13 states have internal predecessors, (81), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-08 16:13:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:47,408 INFO L93 Difference]: Finished difference Result 367 states and 455 transitions. [2025-03-08 16:13:47,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:13:47,411 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 8.1) internal successors, (81), 13 states have internal predecessors, (81), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) Word has length 125 [2025-03-08 16:13:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:47,412 INFO L225 Difference]: With dead ends: 367 [2025-03-08 16:13:47,412 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 16:13:47,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:13:47,413 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 391 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:47,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 494 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:13:47,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 16:13:47,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 159. [2025-03-08 16:13:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 136 states have (on average 1.213235294117647) internal successors, (165), 136 states have internal predecessors, (165), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:13:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 197 transitions. [2025-03-08 16:13:47,426 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 197 transitions. Word has length 125 [2025-03-08 16:13:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:47,426 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 197 transitions. [2025-03-08 16:13:47,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 8.1) internal successors, (81), 13 states have internal predecessors, (81), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-08 16:13:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 197 transitions. [2025-03-08 16:13:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 16:13:47,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:47,427 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:47,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 16:13:47,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:47,628 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:47,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:47,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2035570058, now seen corresponding path program 1 times [2025-03-08 16:13:47,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:47,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675812684] [2025-03-08 16:13:47,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:47,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:47,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 16:13:47,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 16:13:47,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:47,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:13:47,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2038463581] [2025-03-08 16:13:47,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:47,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:47,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:47,672 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:13:47,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 16:13:47,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 16:13:47,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 16:13:47,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:47,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:47,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 16:13:47,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:13:47,960 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 23 treesize of output 11 [2025-03-08 16:13:47,994 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 23 treesize of output 11 [2025-03-08 16:13:48,024 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 23 treesize of output 11 [2025-03-08 16:13:48,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:13:48,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 16:13:48,071 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:48,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:13:48,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:48,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675812684] [2025-03-08 16:13:48,071 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:13:48,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038463581] [2025-03-08 16:13:48,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038463581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:48,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:48,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:13:48,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757516113] [2025-03-08 16:13:48,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:48,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:13:48,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:48,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:13:48,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:13:48,072 INFO L87 Difference]: Start difference. First operand 159 states and 197 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:13:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:48,148 INFO L93 Difference]: Finished difference Result 417 states and 513 transitions. [2025-03-08 16:13:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:13:48,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2025-03-08 16:13:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:48,150 INFO L225 Difference]: With dead ends: 417 [2025-03-08 16:13:48,150 INFO L226 Difference]: Without dead ends: 261 [2025-03-08 16:13:48,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:13:48,151 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 51 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:48,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 279 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-08 16:13:48,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2025-03-08 16:13:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 204 states have (on average 1.1715686274509804) internal successors, (239), 204 states have internal predecessors, (239), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:13:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2025-03-08 16:13:48,169 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 126 [2025-03-08 16:13:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:48,169 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2025-03-08 16:13:48,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:13:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2025-03-08 16:13:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:13:48,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:48,170 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:48,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 16:13:48,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 16:13:48,371 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:48,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:48,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1208991588, now seen corresponding path program 1 times [2025-03-08 16:13:48,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:48,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698788320] [2025-03-08 16:13:48,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:48,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:48,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:13:48,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:13:48,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:48,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:13:48,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [782235763] [2025-03-08 16:13:48,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:48,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:48,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:48,407 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:13:48,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 16:13:48,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:13:48,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:13:48,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:48,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:48,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 16:13:48,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:13:48,616 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 13 [2025-03-08 16:13:48,631 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 29 treesize of output 13 [2025-03-08 16:13:48,646 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 29 treesize of output 13 [2025-03-08 16:13:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:48,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:13:48,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:48,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698788320] [2025-03-08 16:13:48,686 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:13:48,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782235763] [2025-03-08 16:13:48,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782235763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:48,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:48,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:13:48,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115751814] [2025-03-08 16:13:48,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:48,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:13:48,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:48,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:13:48,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:13:48,687 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:13:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:48,776 INFO L93 Difference]: Finished difference Result 493 states and 603 transitions. [2025-03-08 16:13:48,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:13:48,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2025-03-08 16:13:48,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:48,778 INFO L225 Difference]: With dead ends: 493 [2025-03-08 16:13:48,778 INFO L226 Difference]: Without dead ends: 247 [2025-03-08 16:13:48,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:13:48,780 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 22 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:48,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 277 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-08 16:13:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 240. [2025-03-08 16:13:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 195 states have (on average 1.1641025641025642) internal successors, (227), 195 states have internal predecessors, (227), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:13:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 291 transitions. [2025-03-08 16:13:48,799 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 291 transitions. Word has length 127 [2025-03-08 16:13:48,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:48,799 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 291 transitions. [2025-03-08 16:13:48,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:13:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 291 transitions. [2025-03-08 16:13:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:13:48,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:48,801 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:48,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 16:13:49,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:49,002 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:49,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:49,002 INFO L85 PathProgramCache]: Analyzing trace with hash 893535468, now seen corresponding path program 1 times [2025-03-08 16:13:49,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:49,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296710822] [2025-03-08 16:13:49,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:49,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:49,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:13:49,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:13:49,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:49,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:49,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:49,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296710822] [2025-03-08 16:13:49,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296710822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:49,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:49,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:13:49,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136603984] [2025-03-08 16:13:49,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:49,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:13:49,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:49,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:13:49,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:13:49,677 INFO L87 Difference]: Start difference. First operand 240 states and 291 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:13:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:50,226 INFO L93 Difference]: Finished difference Result 526 states and 643 transitions. [2025-03-08 16:13:50,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 16:13:50,227 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-08 16:13:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:50,229 INFO L225 Difference]: With dead ends: 526 [2025-03-08 16:13:50,229 INFO L226 Difference]: Without dead ends: 370 [2025-03-08 16:13:50,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:13:50,230 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 89 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:50,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1766 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:13:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-08 16:13:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 361. [2025-03-08 16:13:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 298 states have (on average 1.1778523489932886) internal successors, (351), 299 states have internal predecessors, (351), 44 states have call successors, (44), 18 states have call predecessors, (44), 18 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:13:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 439 transitions. [2025-03-08 16:13:50,256 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 439 transitions. Word has length 129 [2025-03-08 16:13:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:50,256 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 439 transitions. [2025-03-08 16:13:50,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:13:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 439 transitions. [2025-03-08 16:13:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:13:50,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:50,258 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:50,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:13:50,258 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:50,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:50,258 INFO L85 PathProgramCache]: Analyzing trace with hash 697021963, now seen corresponding path program 1 times [2025-03-08 16:13:50,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:50,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525627557] [2025-03-08 16:13:50,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:50,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:50,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:13:50,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:13:50,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:50,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:50,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:50,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525627557] [2025-03-08 16:13:50,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525627557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:50,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:50,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:13:50,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353219103] [2025-03-08 16:13:50,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:50,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:13:50,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:50,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:13:50,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:50,605 INFO L87 Difference]: Start difference. First operand 361 states and 439 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:13:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:50,861 INFO L93 Difference]: Finished difference Result 814 states and 992 transitions. [2025-03-08 16:13:50,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:13:50,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2025-03-08 16:13:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:50,866 INFO L225 Difference]: With dead ends: 814 [2025-03-08 16:13:50,866 INFO L226 Difference]: Without dead ends: 537 [2025-03-08 16:13:50,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:13:50,869 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 63 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:50,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 736 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:13:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-08 16:13:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533. [2025-03-08 16:13:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 438 states have (on average 1.1757990867579908) internal successors, (515), 441 states have internal predecessors, (515), 64 states have call successors, (64), 30 states have call predecessors, (64), 30 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 16:13:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 643 transitions. [2025-03-08 16:13:50,920 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 643 transitions. Word has length 129 [2025-03-08 16:13:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:50,920 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 643 transitions. [2025-03-08 16:13:50,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:13:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 643 transitions. [2025-03-08 16:13:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:13:50,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:50,922 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:50,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:13:50,922 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:50,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:50,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1425239952, now seen corresponding path program 1 times [2025-03-08 16:13:50,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:50,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383660567] [2025-03-08 16:13:50,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:50,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:50,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:13:50,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:13:50,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:50,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:51,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:51,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383660567] [2025-03-08 16:13:51,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383660567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:51,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:51,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:13:51,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330190521] [2025-03-08 16:13:51,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:51,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:13:51,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:51,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:13:51,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:13:51,426 INFO L87 Difference]: Start difference. First operand 533 states and 643 transitions. Second operand has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 16:13:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:51,995 INFO L93 Difference]: Finished difference Result 1381 states and 1669 transitions. [2025-03-08 16:13:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:13:51,996 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-03-08 16:13:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:52,001 INFO L225 Difference]: With dead ends: 1381 [2025-03-08 16:13:52,001 INFO L226 Difference]: Without dead ends: 932 [2025-03-08 16:13:52,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:13:52,002 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 85 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:52,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1155 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:13:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-03-08 16:13:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 597. [2025-03-08 16:13:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 502 states have (on average 1.1932270916334662) internal successors, (599), 505 states have internal predecessors, (599), 64 states have call successors, (64), 30 states have call predecessors, (64), 30 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 16:13:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 727 transitions. [2025-03-08 16:13:52,076 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 727 transitions. Word has length 129 [2025-03-08 16:13:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:52,076 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 727 transitions. [2025-03-08 16:13:52,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 16:13:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 727 transitions. [2025-03-08 16:13:52,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:13:52,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:52,078 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:52,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:13:52,078 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:52,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:52,078 INFO L85 PathProgramCache]: Analyzing trace with hash 826104682, now seen corresponding path program 1 times [2025-03-08 16:13:52,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:52,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414063693] [2025-03-08 16:13:52,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:52,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:52,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:13:52,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:13:52,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:52,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:52,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414063693] [2025-03-08 16:13:52,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414063693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:52,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:52,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:13:52,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461147526] [2025-03-08 16:13:52,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:52,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:13:52,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:52,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:13:52,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:13:52,506 INFO L87 Difference]: Start difference. First operand 597 states and 727 transitions. Second operand has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:13:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:52,855 INFO L93 Difference]: Finished difference Result 1442 states and 1740 transitions. [2025-03-08 16:13:52,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:13:52,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-08 16:13:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:52,859 INFO L225 Difference]: With dead ends: 1442 [2025-03-08 16:13:52,860 INFO L226 Difference]: Without dead ends: 929 [2025-03-08 16:13:52,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:13:52,861 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 79 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:52,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 829 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:13:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-03-08 16:13:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 625. [2025-03-08 16:13:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 530 states have (on average 1.179245283018868) internal successors, (625), 533 states have internal predecessors, (625), 64 states have call successors, (64), 30 states have call predecessors, (64), 30 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 16:13:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 753 transitions. [2025-03-08 16:13:52,925 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 753 transitions. Word has length 129 [2025-03-08 16:13:52,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:52,925 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 753 transitions. [2025-03-08 16:13:52,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:13:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 753 transitions. [2025-03-08 16:13:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:13:52,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:52,928 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:52,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:13:52,928 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:52,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash 826528715, now seen corresponding path program 1 times [2025-03-08 16:13:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:52,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505302019] [2025-03-08 16:13:52,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:52,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:52,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:13:52,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:13:52,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:52,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:53,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:53,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505302019] [2025-03-08 16:13:53,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505302019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:53,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:53,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:13:53,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320488602] [2025-03-08 16:13:53,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:53,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:13:53,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:53,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:13:53,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:13:53,053 INFO L87 Difference]: Start difference. First operand 625 states and 753 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:13:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:53,239 INFO L93 Difference]: Finished difference Result 1297 states and 1560 transitions. [2025-03-08 16:13:53,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:13:53,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-08 16:13:53,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:53,242 INFO L225 Difference]: With dead ends: 1297 [2025-03-08 16:13:53,243 INFO L226 Difference]: Without dead ends: 756 [2025-03-08 16:13:53,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:53,244 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 89 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:53,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 515 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:53,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-03-08 16:13:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 594. [2025-03-08 16:13:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 499 states have (on average 1.1783567134268538) internal successors, (588), 502 states have internal predecessors, (588), 64 states have call successors, (64), 30 states have call predecessors, (64), 30 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 16:13:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 716 transitions. [2025-03-08 16:13:53,295 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 716 transitions. Word has length 129 [2025-03-08 16:13:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:53,295 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 716 transitions. [2025-03-08 16:13:53,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:13:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 716 transitions. [2025-03-08 16:13:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:13:53,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:53,297 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:53,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:13:53,297 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:53,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1590696304, now seen corresponding path program 1 times [2025-03-08 16:13:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:53,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564966344] [2025-03-08 16:13:53,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:53,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:13:53,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:13:53,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:53,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:53,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:53,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564966344] [2025-03-08 16:13:53,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564966344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:53,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:53,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:13:53,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419914366] [2025-03-08 16:13:53,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:53,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:13:53,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:53,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:13:53,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:13:53,908 INFO L87 Difference]: Start difference. First operand 594 states and 716 transitions. Second operand has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 16:13:54,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:54,415 INFO L93 Difference]: Finished difference Result 1243 states and 1496 transitions. [2025-03-08 16:13:54,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:13:54,416 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-03-08 16:13:54,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:54,419 INFO L225 Difference]: With dead ends: 1243 [2025-03-08 16:13:54,419 INFO L226 Difference]: Without dead ends: 733 [2025-03-08 16:13:54,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:13:54,420 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 79 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:54,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 948 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:13:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-08 16:13:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 729. [2025-03-08 16:13:54,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 597 states have (on average 1.1658291457286432) internal successors, (696), 602 states have internal predecessors, (696), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-08 16:13:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 872 transitions. [2025-03-08 16:13:54,483 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 872 transitions. Word has length 129 [2025-03-08 16:13:54,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:54,483 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 872 transitions. [2025-03-08 16:13:54,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 16:13:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 872 transitions. [2025-03-08 16:13:54,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:13:54,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:54,485 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:54,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:13:54,485 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:54,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:54,485 INFO L85 PathProgramCache]: Analyzing trace with hash -728079116, now seen corresponding path program 1 times [2025-03-08 16:13:54,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:54,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541872426] [2025-03-08 16:13:54,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:54,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:54,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:13:54,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:13:54,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:54,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:55,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:55,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541872426] [2025-03-08 16:13:55,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541872426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:55,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:55,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 16:13:55,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951597254] [2025-03-08 16:13:55,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:55,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 16:13:55,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:55,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 16:13:55,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:13:55,763 INFO L87 Difference]: Start difference. First operand 729 states and 872 transitions. Second operand has 21 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 21 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-08 16:13:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:57,443 INFO L93 Difference]: Finished difference Result 1555 states and 1853 transitions. [2025-03-08 16:13:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 16:13:57,444 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 21 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) Word has length 129 [2025-03-08 16:13:57,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:57,447 INFO L225 Difference]: With dead ends: 1555 [2025-03-08 16:13:57,448 INFO L226 Difference]: Without dead ends: 959 [2025-03-08 16:13:57,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 16:13:57,449 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 165 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:57,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 2331 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 16:13:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-08 16:13:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 766. [2025-03-08 16:13:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 634 states have (on average 1.167192429022082) internal successors, (740), 639 states have internal predecessors, (740), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-08 16:13:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 916 transitions. [2025-03-08 16:13:57,536 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 916 transitions. Word has length 129 [2025-03-08 16:13:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:57,537 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 916 transitions. [2025-03-08 16:13:57,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 21 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-08 16:13:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 916 transitions. [2025-03-08 16:13:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:13:57,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:57,539 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:57,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:13:57,539 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:57,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:57,540 INFO L85 PathProgramCache]: Analyzing trace with hash -924592621, now seen corresponding path program 1 times [2025-03-08 16:13:57,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:57,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662375125] [2025-03-08 16:13:57,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:57,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:57,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:13:57,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:13:57,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:57,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:57,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:57,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662375125] [2025-03-08 16:13:57,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662375125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:57,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:57,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:13:57,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140885964] [2025-03-08 16:13:57,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:57,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:13:57,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:57,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:13:57,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:57,833 INFO L87 Difference]: Start difference. First operand 766 states and 916 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:13:58,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:58,112 INFO L93 Difference]: Finished difference Result 1474 states and 1764 transitions. [2025-03-08 16:13:58,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:13:58,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2025-03-08 16:13:58,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:58,117 INFO L225 Difference]: With dead ends: 1474 [2025-03-08 16:13:58,117 INFO L226 Difference]: Without dead ends: 841 [2025-03-08 16:13:58,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:13:58,118 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 62 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:58,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 738 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:13:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-03-08 16:13:58,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 766. [2025-03-08 16:13:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 634 states have (on average 1.1545741324921135) internal successors, (732), 639 states have internal predecessors, (732), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-08 16:13:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 908 transitions. [2025-03-08 16:13:58,201 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 908 transitions. Word has length 129 [2025-03-08 16:13:58,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:58,202 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 908 transitions. [2025-03-08 16:13:58,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:13:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 908 transitions. [2025-03-08 16:13:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:13:58,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:58,203 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:58,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:13:58,204 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:58,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash -795085869, now seen corresponding path program 1 times [2025-03-08 16:13:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:58,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625498489] [2025-03-08 16:13:58,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:58,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:58,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:13:58,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:13:58,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:58,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:58,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625498489] [2025-03-08 16:13:58,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625498489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:58,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:58,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:13:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970486117] [2025-03-08 16:13:58,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:58,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:13:58,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:58,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:13:58,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:13:58,392 INFO L87 Difference]: Start difference. First operand 766 states and 908 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:13:58,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:58,600 INFO L93 Difference]: Finished difference Result 1362 states and 1619 transitions. [2025-03-08 16:13:58,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:13:58,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-08 16:13:58,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:58,603 INFO L225 Difference]: With dead ends: 1362 [2025-03-08 16:13:58,603 INFO L226 Difference]: Without dead ends: 729 [2025-03-08 16:13:58,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:58,606 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 86 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:58,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 525 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:58,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-08 16:13:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 727. [2025-03-08 16:13:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 595 states have (on average 1.1512605042016806) internal successors, (685), 600 states have internal predecessors, (685), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-08 16:13:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 861 transitions. [2025-03-08 16:13:58,674 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 861 transitions. Word has length 129 [2025-03-08 16:13:58,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:58,674 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 861 transitions. [2025-03-08 16:13:58,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:13:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 861 transitions. [2025-03-08 16:13:58,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:13:58,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:58,675 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:58,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:13:58,676 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:58,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:58,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1394220145, now seen corresponding path program 1 times [2025-03-08 16:13:58,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:58,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891718552] [2025-03-08 16:13:58,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:58,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:58,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:13:58,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:13:58,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:58,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:58,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:58,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891718552] [2025-03-08 16:13:58,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891718552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:58,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:58,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:13:58,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043439862] [2025-03-08 16:13:58,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:58,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:58,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:58,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:58,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:58,957 INFO L87 Difference]: Start difference. First operand 727 states and 861 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:13:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:59,086 INFO L93 Difference]: Finished difference Result 1110 states and 1318 transitions. [2025-03-08 16:13:59,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:13:59,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2025-03-08 16:13:59,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:59,088 INFO L225 Difference]: With dead ends: 1110 [2025-03-08 16:13:59,088 INFO L226 Difference]: Without dead ends: 516 [2025-03-08 16:13:59,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:59,090 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:59,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 481 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-08 16:13:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-08 16:13:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 418 states have (on average 1.138755980861244) internal successors, (476), 421 states have internal predecessors, (476), 66 states have call successors, (66), 31 states have call predecessors, (66), 31 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:13:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 608 transitions. [2025-03-08 16:13:59,145 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 608 transitions. Word has length 129 [2025-03-08 16:13:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:59,145 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 608 transitions. [2025-03-08 16:13:59,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:13:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 608 transitions. [2025-03-08 16:13:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:13:59,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:59,146 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:59,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:13:59,147 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:59,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:59,147 INFO L85 PathProgramCache]: Analyzing trace with hash 857548522, now seen corresponding path program 1 times [2025-03-08 16:13:59,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:59,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155937788] [2025-03-08 16:13:59,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:59,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:59,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:13:59,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:13:59,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:59,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:13:59,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:59,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155937788] [2025-03-08 16:13:59,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155937788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:59,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:59,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:13:59,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094001546] [2025-03-08 16:13:59,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:59,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:13:59,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:59,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:13:59,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:13:59,607 INFO L87 Difference]: Start difference. First operand 516 states and 608 transitions. Second operand has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:13:59,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:59,892 INFO L93 Difference]: Finished difference Result 894 states and 1053 transitions. [2025-03-08 16:13:59,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:13:59,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-08 16:13:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:59,895 INFO L225 Difference]: With dead ends: 894 [2025-03-08 16:13:59,896 INFO L226 Difference]: Without dead ends: 511 [2025-03-08 16:13:59,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:13:59,897 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 81 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:59,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 698 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:13:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-08 16:13:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 508. [2025-03-08 16:13:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 409 states have (on average 1.1271393643031784) internal successors, (461), 412 states have internal predecessors, (461), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:13:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 593 transitions. [2025-03-08 16:13:59,955 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 593 transitions. Word has length 129 [2025-03-08 16:13:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:59,955 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 593 transitions. [2025-03-08 16:13:59,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:13:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 593 transitions. [2025-03-08 16:13:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:13:59,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:59,956 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:59,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:13:59,957 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:59,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:59,957 INFO L85 PathProgramCache]: Analyzing trace with hash 986631241, now seen corresponding path program 1 times [2025-03-08 16:13:59,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:59,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411628730] [2025-03-08 16:13:59,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:59,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:59,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:13:59,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:13:59,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:59,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:00,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:00,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411628730] [2025-03-08 16:14:00,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411628730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:00,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:00,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:14:00,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809506642] [2025-03-08 16:14:00,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:00,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:00,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:00,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:00,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:00,151 INFO L87 Difference]: Start difference. First operand 508 states and 593 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:00,390 INFO L93 Difference]: Finished difference Result 946 states and 1107 transitions. [2025-03-08 16:14:00,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:14:00,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-08 16:14:00,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:00,393 INFO L225 Difference]: With dead ends: 946 [2025-03-08 16:14:00,393 INFO L226 Difference]: Without dead ends: 575 [2025-03-08 16:14:00,393 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:14:00,394 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 65 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:00,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 508 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:14:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-08 16:14:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 508. [2025-03-08 16:14:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 409 states have (on average 1.1222493887530562) internal successors, (459), 412 states have internal predecessors, (459), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:14:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 591 transitions. [2025-03-08 16:14:00,479 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 591 transitions. Word has length 129 [2025-03-08 16:14:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:00,480 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 591 transitions. [2025-03-08 16:14:00,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 591 transitions. [2025-03-08 16:14:00,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:14:00,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:00,482 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:00,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:14:00,482 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:00,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:00,483 INFO L85 PathProgramCache]: Analyzing trace with hash 790117736, now seen corresponding path program 1 times [2025-03-08 16:14:00,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:00,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890173405] [2025-03-08 16:14:00,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:00,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:00,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:14:00,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:14:00,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:00,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:01,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:01,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890173405] [2025-03-08 16:14:01,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890173405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:01,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:01,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:14:01,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18508431] [2025-03-08 16:14:01,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:01,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:14:01,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:01,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:14:01,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:14:01,100 INFO L87 Difference]: Start difference. First operand 508 states and 591 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:14:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:01,657 INFO L93 Difference]: Finished difference Result 1008 states and 1178 transitions. [2025-03-08 16:14:01,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 16:14:01,657 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-08 16:14:01,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:01,660 INFO L225 Difference]: With dead ends: 1008 [2025-03-08 16:14:01,660 INFO L226 Difference]: Without dead ends: 637 [2025-03-08 16:14:01,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:14:01,661 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 79 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:01,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 2043 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:14:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-08 16:14:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 540. [2025-03-08 16:14:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 441 states have (on average 1.129251700680272) internal successors, (498), 444 states have internal predecessors, (498), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:14:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 630 transitions. [2025-03-08 16:14:01,721 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 630 transitions. Word has length 129 [2025-03-08 16:14:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:01,721 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 630 transitions. [2025-03-08 16:14:01,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:14:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 630 transitions. [2025-03-08 16:14:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:14:01,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:01,722 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:01,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:14:01,722 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:01,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:01,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1332144179, now seen corresponding path program 1 times [2025-03-08 16:14:01,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:01,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962118201] [2025-03-08 16:14:01,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:01,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:01,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:14:01,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:14:01,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:01,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:01,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:01,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962118201] [2025-03-08 16:14:01,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962118201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:01,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:01,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:14:01,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132871904] [2025-03-08 16:14:01,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:01,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:01,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:01,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:01,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:01,900 INFO L87 Difference]: Start difference. First operand 540 states and 630 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:02,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:02,136 INFO L93 Difference]: Finished difference Result 1016 states and 1187 transitions. [2025-03-08 16:14:02,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:14:02,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-08 16:14:02,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:02,139 INFO L225 Difference]: With dead ends: 1016 [2025-03-08 16:14:02,139 INFO L226 Difference]: Without dead ends: 613 [2025-03-08 16:14:02,140 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:14:02,140 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 64 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:02,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 508 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:14:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-03-08 16:14:02,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 540. [2025-03-08 16:14:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 441 states have (on average 1.124716553287982) internal successors, (496), 444 states have internal predecessors, (496), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:14:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 628 transitions. [2025-03-08 16:14:02,191 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 628 transitions. Word has length 129 [2025-03-08 16:14:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:02,191 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 628 transitions. [2025-03-08 16:14:02,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 628 transitions. [2025-03-08 16:14:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:14:02,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:02,192 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:02,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:14:02,192 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:02,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:02,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1528657684, now seen corresponding path program 1 times [2025-03-08 16:14:02,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:02,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191562563] [2025-03-08 16:14:02,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:02,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:02,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:14:02,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:14:02,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:02,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:02,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:02,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191562563] [2025-03-08 16:14:02,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191562563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:02,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:02,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:14:02,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115364423] [2025-03-08 16:14:02,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:02,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:14:02,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:02,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:14:02,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:14:02,626 INFO L87 Difference]: Start difference. First operand 540 states and 628 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:14:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:02,989 INFO L93 Difference]: Finished difference Result 1016 states and 1183 transitions. [2025-03-08 16:14:02,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:14:02,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-08 16:14:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:02,991 INFO L225 Difference]: With dead ends: 1016 [2025-03-08 16:14:02,991 INFO L226 Difference]: Without dead ends: 613 [2025-03-08 16:14:02,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:14:02,992 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 70 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:02,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1207 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:14:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-03-08 16:14:03,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 540. [2025-03-08 16:14:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 441 states have (on average 1.1201814058956916) internal successors, (494), 444 states have internal predecessors, (494), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:14:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 626 transitions. [2025-03-08 16:14:03,044 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 626 transitions. Word has length 129 [2025-03-08 16:14:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:03,044 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 626 transitions. [2025-03-08 16:14:03,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:14:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 626 transitions. [2025-03-08 16:14:03,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:14:03,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:03,045 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:03,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:14:03,045 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:03,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:03,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1554285325, now seen corresponding path program 1 times [2025-03-08 16:14:03,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:03,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057471374] [2025-03-08 16:14:03,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:03,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:03,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:14:03,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:14:03,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:03,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:03,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:03,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057471374] [2025-03-08 16:14:03,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057471374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:03,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:03,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:14:03,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117400407] [2025-03-08 16:14:03,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:03,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:14:03,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:03,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:14:03,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:14:03,468 INFO L87 Difference]: Start difference. First operand 540 states and 626 transitions. Second operand has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:14:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:03,718 INFO L93 Difference]: Finished difference Result 1041 states and 1209 transitions. [2025-03-08 16:14:03,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:14:03,719 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-08 16:14:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:03,721 INFO L225 Difference]: With dead ends: 1041 [2025-03-08 16:14:03,721 INFO L226 Difference]: Without dead ends: 636 [2025-03-08 16:14:03,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:14:03,722 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 76 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:03,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 863 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:14:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-08 16:14:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 563. [2025-03-08 16:14:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 464 states have (on average 1.1206896551724137) internal successors, (520), 467 states have internal predecessors, (520), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:14:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 652 transitions. [2025-03-08 16:14:03,774 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 652 transitions. Word has length 129 [2025-03-08 16:14:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:03,774 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 652 transitions. [2025-03-08 16:14:03,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:14:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 652 transitions. [2025-03-08 16:14:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:14:03,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:03,775 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:03,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 16:14:03,776 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:03,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1487278572, now seen corresponding path program 1 times [2025-03-08 16:14:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:03,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061715449] [2025-03-08 16:14:03,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:03,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:14:03,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:14:03,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:03,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:04,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061715449] [2025-03-08 16:14:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061715449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:04,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:04,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:14:04,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781998132] [2025-03-08 16:14:04,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:04,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:14:04,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:04,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:14:04,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:14:04,150 INFO L87 Difference]: Start difference. First operand 563 states and 652 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:14:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:04,550 INFO L93 Difference]: Finished difference Result 1058 states and 1227 transitions. [2025-03-08 16:14:04,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:14:04,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-08 16:14:04,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:04,553 INFO L225 Difference]: With dead ends: 1058 [2025-03-08 16:14:04,553 INFO L226 Difference]: Without dead ends: 632 [2025-03-08 16:14:04,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:14:04,554 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 74 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:04,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 874 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:14:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-08 16:14:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 559. [2025-03-08 16:14:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 460 states have (on average 1.117391304347826) internal successors, (514), 463 states have internal predecessors, (514), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:14:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 646 transitions. [2025-03-08 16:14:04,614 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 646 transitions. Word has length 129 [2025-03-08 16:14:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:04,614 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 646 transitions. [2025-03-08 16:14:04,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:14:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 646 transitions. [2025-03-08 16:14:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:14:04,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:04,615 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:04,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 16:14:04,615 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:04,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash -831496848, now seen corresponding path program 1 times [2025-03-08 16:14:04,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:04,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681073687] [2025-03-08 16:14:04,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:04,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:04,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:14:04,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:14:04,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:04,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:05,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:05,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681073687] [2025-03-08 16:14:05,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681073687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:05,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:05,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:14:05,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918479329] [2025-03-08 16:14:05,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:05,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:14:05,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:05,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:14:05,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:14:05,131 INFO L87 Difference]: Start difference. First operand 559 states and 646 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:14:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:05,647 INFO L93 Difference]: Finished difference Result 1066 states and 1231 transitions. [2025-03-08 16:14:05,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 16:14:05,647 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-08 16:14:05,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:05,650 INFO L225 Difference]: With dead ends: 1066 [2025-03-08 16:14:05,650 INFO L226 Difference]: Without dead ends: 644 [2025-03-08 16:14:05,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:14:05,651 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 70 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:05,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 2131 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:14:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-03-08 16:14:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 551. [2025-03-08 16:14:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 452 states have (on average 1.1150442477876106) internal successors, (504), 455 states have internal predecessors, (504), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:14:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 636 transitions. [2025-03-08 16:14:05,740 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 636 transitions. Word has length 129 [2025-03-08 16:14:05,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:05,741 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 636 transitions. [2025-03-08 16:14:05,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:14:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 636 transitions. [2025-03-08 16:14:05,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:14:05,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:05,742 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:05,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 16:14:05,743 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:05,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:05,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1746639435, now seen corresponding path program 1 times [2025-03-08 16:14:05,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:05,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278572587] [2025-03-08 16:14:05,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:05,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:05,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:14:05,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:14:05,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:05,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:05,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:05,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278572587] [2025-03-08 16:14:05,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278572587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:05,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:05,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:14:05,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771405383] [2025-03-08 16:14:05,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:05,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:14:05,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:05,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:14:05,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:14:05,830 INFO L87 Difference]: Start difference. First operand 551 states and 636 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:05,912 INFO L93 Difference]: Finished difference Result 967 states and 1118 transitions. [2025-03-08 16:14:05,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:14:05,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-08 16:14:05,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:05,914 INFO L225 Difference]: With dead ends: 967 [2025-03-08 16:14:05,914 INFO L226 Difference]: Without dead ends: 530 [2025-03-08 16:14:05,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:05,915 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 66 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:05,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 465 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:14:05,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-08 16:14:05,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2025-03-08 16:14:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 429 states have (on average 1.0932400932400932) internal successors, (469), 432 states have internal predecessors, (469), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:14:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 601 transitions. [2025-03-08 16:14:05,969 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 601 transitions. Word has length 131 [2025-03-08 16:14:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:05,969 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 601 transitions. [2025-03-08 16:14:05,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 601 transitions. [2025-03-08 16:14:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:14:05,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:05,970 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:05,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 16:14:05,970 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:05,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:05,971 INFO L85 PathProgramCache]: Analyzing trace with hash 621306219, now seen corresponding path program 1 times [2025-03-08 16:14:05,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:05,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957462538] [2025-03-08 16:14:05,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:05,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:05,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:14:06,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:14:06,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:06,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-08 16:14:06,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:06,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957462538] [2025-03-08 16:14:06,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957462538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:14:06,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999382380] [2025-03-08 16:14:06,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:06,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:14:06,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:14:06,391 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:14:06,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 16:14:06,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:14:06,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:14:06,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:06,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:06,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 16:14:06,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:06,700 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 9 treesize of output 3 [2025-03-08 16:14:06,731 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:14:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 149 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-08 16:14:06,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:14:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-03-08 16:14:07,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999382380] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:14:07,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:14:07,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 28 [2025-03-08 16:14:07,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732921704] [2025-03-08 16:14:07,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:14:07,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 16:14:07,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:07,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 16:14:07,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2025-03-08 16:14:07,132 INFO L87 Difference]: Start difference. First operand 528 states and 601 transitions. Second operand has 28 states, 22 states have (on average 4.863636363636363) internal successors, (107), 26 states have internal predecessors, (107), 11 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 11 states have call successors, (35) [2025-03-08 16:14:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:07,742 INFO L93 Difference]: Finished difference Result 925 states and 1046 transitions. [2025-03-08 16:14:07,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 16:14:07,742 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 4.863636363636363) internal successors, (107), 26 states have internal predecessors, (107), 11 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 11 states have call successors, (35) Word has length 136 [2025-03-08 16:14:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:07,744 INFO L225 Difference]: With dead ends: 925 [2025-03-08 16:14:07,744 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 16:14:07,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=359, Invalid=1447, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 16:14:07,745 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 459 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:07,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 570 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:14:07,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 16:14:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 512. [2025-03-08 16:14:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 409 states have (on average 1.0880195599022005) internal successors, (445), 412 states have internal predecessors, (445), 66 states have call successors, (66), 36 states have call predecessors, (66), 36 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:14:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 577 transitions. [2025-03-08 16:14:07,802 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 577 transitions. Word has length 136 [2025-03-08 16:14:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:07,802 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 577 transitions. [2025-03-08 16:14:07,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 4.863636363636363) internal successors, (107), 26 states have internal predecessors, (107), 11 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 11 states have call successors, (35) [2025-03-08 16:14:07,803 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 577 transitions. [2025-03-08 16:14:07,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:14:07,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:07,803 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:07,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 16:14:08,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-08 16:14:08,004 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:08,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:08,004 INFO L85 PathProgramCache]: Analyzing trace with hash -930829589, now seen corresponding path program 1 times [2025-03-08 16:14:08,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:08,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441329851] [2025-03-08 16:14:08,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:08,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:08,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:14:08,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:14:08,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:08,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:14:08,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1284474323] [2025-03-08 16:14:08,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:08,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:14:08,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:14:08,059 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:14:08,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 16:14:08,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:14:08,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:14:08,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:08,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:08,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 16:14:08,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:08,407 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 13 [2025-03-08 16:14:08,424 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 29 treesize of output 13 [2025-03-08 16:14:08,438 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 29 treesize of output 13 [2025-03-08 16:14:08,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:14:08,484 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 48 treesize of output 29 [2025-03-08 16:14:08,554 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:08,554 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:08,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:08,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441329851] [2025-03-08 16:14:08,554 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:14:08,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284474323] [2025-03-08 16:14:08,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284474323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:08,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:08,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:14:08,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533600451] [2025-03-08 16:14:08,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:08,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:14:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:08,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:14:08,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:14:08,556 INFO L87 Difference]: Start difference. First operand 512 states and 577 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:08,848 INFO L93 Difference]: Finished difference Result 974 states and 1099 transitions. [2025-03-08 16:14:08,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:14:08,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-03-08 16:14:08,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:08,851 INFO L225 Difference]: With dead ends: 974 [2025-03-08 16:14:08,851 INFO L226 Difference]: Without dead ends: 607 [2025-03-08 16:14:08,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:14:08,852 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 98 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:08,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 377 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:14:08,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-08 16:14:08,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 520. [2025-03-08 16:14:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 417 states have (on average 1.091127098321343) internal successors, (455), 420 states have internal predecessors, (455), 66 states have call successors, (66), 36 states have call predecessors, (66), 36 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:14:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 587 transitions. [2025-03-08 16:14:08,910 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 587 transitions. Word has length 136 [2025-03-08 16:14:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:08,910 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 587 transitions. [2025-03-08 16:14:08,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 587 transitions. [2025-03-08 16:14:08,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:14:08,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:08,911 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:08,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 16:14:09,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-08 16:14:09,112 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:09,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1588046677, now seen corresponding path program 1 times [2025-03-08 16:14:09,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:09,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100052516] [2025-03-08 16:14:09,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:09,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:09,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:14:09,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:14:09,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:09,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-08 16:14:09,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:09,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100052516] [2025-03-08 16:14:09,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100052516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:14:09,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200937441] [2025-03-08 16:14:09,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:09,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:14:09,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:14:09,590 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:14:09,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 16:14:09,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:14:09,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:14:09,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:09,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:09,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 16:14:09,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:09,837 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 29 treesize of output 13 [2025-03-08 16:14:09,862 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 29 treesize of output 13 [2025-03-08 16:14:09,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:14:09,968 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 40 treesize of output 27 [2025-03-08 16:14:10,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:14:10,039 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 39 treesize of output 19 [2025-03-08 16:14:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 231 proven. 12 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-03-08 16:14:10,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:14:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-03-08 16:14:10,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200937441] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:14:10,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:14:10,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29 [2025-03-08 16:14:10,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229942092] [2025-03-08 16:14:10,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:14:10,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 16:14:10,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:10,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 16:14:10,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:14:10,354 INFO L87 Difference]: Start difference. First operand 520 states and 587 transitions. Second operand has 29 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 29 states have internal predecessors, (148), 13 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 13 states have call successors, (37) [2025-03-08 16:14:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:10,997 INFO L93 Difference]: Finished difference Result 885 states and 996 transitions. [2025-03-08 16:14:10,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 16:14:10,998 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 29 states have internal predecessors, (148), 13 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 13 states have call successors, (37) Word has length 136 [2025-03-08 16:14:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:11,000 INFO L225 Difference]: With dead ends: 885 [2025-03-08 16:14:11,000 INFO L226 Difference]: Without dead ends: 518 [2025-03-08 16:14:11,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 258 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=396, Invalid=1674, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 16:14:11,001 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 314 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:11,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 608 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:14:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-08 16:14:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 406. [2025-03-08 16:14:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 323 states have (on average 1.0866873065015479) internal successors, (351), 325 states have internal predecessors, (351), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:14:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 455 transitions. [2025-03-08 16:14:11,052 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 455 transitions. Word has length 136 [2025-03-08 16:14:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:11,052 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 455 transitions. [2025-03-08 16:14:11,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 29 states have internal predecessors, (148), 13 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 13 states have call successors, (37) [2025-03-08 16:14:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 455 transitions. [2025-03-08 16:14:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:14:11,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:11,053 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:11,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 16:14:11,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-08 16:14:11,257 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:11,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:11,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1154784811, now seen corresponding path program 1 times [2025-03-08 16:14:11,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:11,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897150628] [2025-03-08 16:14:11,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:11,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:11,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:14:11,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:14:11,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:11,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:14:11,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [748829439] [2025-03-08 16:14:11,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:11,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:14:11,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:14:11,315 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:14:11,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 16:14:11,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:14:11,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:14:11,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:11,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:11,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 16:14:11,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:11,646 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 7 treesize of output 3 [2025-03-08 16:14:11,650 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:14:11,651 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:14:11,655 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:14:11,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:14:11,765 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 64 treesize of output 26 [2025-03-08 16:14:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:11,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:11,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:11,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897150628] [2025-03-08 16:14:11,782 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:14:11,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748829439] [2025-03-08 16:14:11,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748829439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:11,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:11,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:14:11,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486423513] [2025-03-08 16:14:11,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:11,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:14:11,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:11,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:14:11,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:14:11,783 INFO L87 Difference]: Start difference. First operand 406 states and 455 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:12,037 INFO L93 Difference]: Finished difference Result 990 states and 1104 transitions. [2025-03-08 16:14:12,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:14:12,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-03-08 16:14:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:12,039 INFO L225 Difference]: With dead ends: 990 [2025-03-08 16:14:12,039 INFO L226 Difference]: Without dead ends: 632 [2025-03-08 16:14:12,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:12,040 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 56 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:12,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 524 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:14:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-08 16:14:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 452. [2025-03-08 16:14:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 369 states have (on average 1.067750677506775) internal successors, (394), 371 states have internal predecessors, (394), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:14:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 498 transitions. [2025-03-08 16:14:12,094 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 498 transitions. Word has length 136 [2025-03-08 16:14:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:12,094 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 498 transitions. [2025-03-08 16:14:12,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 498 transitions. [2025-03-08 16:14:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 16:14:12,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:12,095 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:12,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 16:14:12,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-08 16:14:12,295 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:12,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:12,296 INFO L85 PathProgramCache]: Analyzing trace with hash 80077613, now seen corresponding path program 1 times [2025-03-08 16:14:12,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:12,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752886342] [2025-03-08 16:14:12,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:12,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:12,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:14:12,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:14:12,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:12,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:14:12,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734712098] [2025-03-08 16:14:12,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:12,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:14:12,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:14:12,354 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:14:12,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 16:14:12,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:14:12,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:14:12,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:12,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:12,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 16:14:12,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:12,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:14:12,717 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 34 treesize of output 25 [2025-03-08 16:14:12,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:14:12,755 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 38 treesize of output 16 [2025-03-08 16:14:12,773 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 29 treesize of output 13 [2025-03-08 16:14:12,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:14:12,816 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 48 treesize of output 29 [2025-03-08 16:14:12,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:14:12,885 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 83 treesize of output 35 [2025-03-08 16:14:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 16:14:12,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:14:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:13,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:13,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752886342] [2025-03-08 16:14:13,415 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:14:13,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734712098] [2025-03-08 16:14:13,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734712098] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:14:13,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:14:13,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2025-03-08 16:14:13,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609089121] [2025-03-08 16:14:13,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:13,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:14:13,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:13,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:14:13,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:14:13,416 INFO L87 Difference]: Start difference. First operand 452 states and 498 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:14,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:14,105 INFO L93 Difference]: Finished difference Result 864 states and 951 transitions. [2025-03-08 16:14:14,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:14:14,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2025-03-08 16:14:14,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:14,108 INFO L225 Difference]: With dead ends: 864 [2025-03-08 16:14:14,108 INFO L226 Difference]: Without dead ends: 579 [2025-03-08 16:14:14,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:14:14,109 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 219 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:14,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 486 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:14:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-08 16:14:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 472. [2025-03-08 16:14:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 389 states have (on average 1.0668380462724936) internal successors, (415), 391 states have internal predecessors, (415), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:14:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 519 transitions. [2025-03-08 16:14:14,169 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 519 transitions. Word has length 137 [2025-03-08 16:14:14,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:14,169 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 519 transitions. [2025-03-08 16:14:14,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 519 transitions. [2025-03-08 16:14:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 16:14:14,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:14,170 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:14,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 16:14:14,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:14:14,371 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:14,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1984536489, now seen corresponding path program 1 times [2025-03-08 16:14:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:14,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989429198] [2025-03-08 16:14:14,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:14,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:14,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:14:14,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:14:14,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:14,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:14:14,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059515738] [2025-03-08 16:14:14,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:14,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:14:14,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:14:14,422 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:14:14,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 16:14:14,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:14:14,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:14:14,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:14,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:14,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 16:14:14,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:14,606 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 9 treesize of output 3 [2025-03-08 16:14:14,612 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:14:14,614 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:14:14,617 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:14:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:14,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:14,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989429198] [2025-03-08 16:14:14,727 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:14:14,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059515738] [2025-03-08 16:14:14,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059515738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:14,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:14,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:14:14,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094964275] [2025-03-08 16:14:14,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:14,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:14:14,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:14,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:14:14,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:14:14,728 INFO L87 Difference]: Start difference. First operand 472 states and 519 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:14,991 INFO L93 Difference]: Finished difference Result 1033 states and 1130 transitions. [2025-03-08 16:14:14,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:14:14,991 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2025-03-08 16:14:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:14,994 INFO L225 Difference]: With dead ends: 1033 [2025-03-08 16:14:14,994 INFO L226 Difference]: Without dead ends: 564 [2025-03-08 16:14:14,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:14:14,994 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 45 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:14,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 269 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:14:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-08 16:14:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 357. [2025-03-08 16:14:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 304 states have (on average 1.0625) internal successors, (323), 304 states have internal predecessors, (323), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:14:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 387 transitions. [2025-03-08 16:14:15,045 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 387 transitions. Word has length 137 [2025-03-08 16:14:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:15,045 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 387 transitions. [2025-03-08 16:14:15,045 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 387 transitions. [2025-03-08 16:14:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:14:15,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:15,045 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:15,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 16:14:15,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:14:15,246 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:15,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:15,246 INFO L85 PathProgramCache]: Analyzing trace with hash -637466220, now seen corresponding path program 1 times [2025-03-08 16:14:15,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:15,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665056477] [2025-03-08 16:14:15,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:15,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:15,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:14:15,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:14:15,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:15,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:14:15,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [779432841] [2025-03-08 16:14:15,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:15,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:14:15,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:14:15,317 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:14:15,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 16:14:15,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:14:15,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:14:15,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:15,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:15,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 16:14:15,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:15,526 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 15 treesize of output 1 [2025-03-08 16:14:15,529 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:14:15,532 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:14:15,535 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:14:15,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:14:15,630 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 66 treesize of output 28 [2025-03-08 16:14:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:15,650 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:15,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:15,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665056477] [2025-03-08 16:14:15,650 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:14:15,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779432841] [2025-03-08 16:14:15,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779432841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:15,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:15,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:14:15,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654013720] [2025-03-08 16:14:15,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:15,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:15,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:15,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:15,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:15,652 INFO L87 Difference]: Start difference. First operand 357 states and 387 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:15,920 INFO L93 Difference]: Finished difference Result 653 states and 708 transitions. [2025-03-08 16:14:15,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:14:15,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2025-03-08 16:14:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:15,922 INFO L225 Difference]: With dead ends: 653 [2025-03-08 16:14:15,922 INFO L226 Difference]: Without dead ends: 394 [2025-03-08 16:14:15,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:14:15,923 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 56 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:15,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 514 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:14:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-08 16:14:15,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 328. [2025-03-08 16:14:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 275 states have (on average 1.050909090909091) internal successors, (289), 275 states have internal predecessors, (289), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:14:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 353 transitions. [2025-03-08 16:14:15,981 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 353 transitions. Word has length 138 [2025-03-08 16:14:15,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:15,981 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 353 transitions. [2025-03-08 16:14:15,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 353 transitions. [2025-03-08 16:14:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:14:15,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:15,982 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:15,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 16:14:16,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-08 16:14:16,183 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:16,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:16,183 INFO L85 PathProgramCache]: Analyzing trace with hash -252583860, now seen corresponding path program 1 times [2025-03-08 16:14:16,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:16,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134481272] [2025-03-08 16:14:16,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:16,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:16,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:14:16,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:14:16,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:16,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:14:16,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861129070] [2025-03-08 16:14:16,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:16,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:14:16,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:14:16,248 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:14:16,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 16:14:16,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:14:16,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:14:16,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:16,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:16,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 16:14:16,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:16,496 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 7 treesize of output 3 [2025-03-08 16:14:16,499 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:14:16,500 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:14:16,502 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:14:16,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:14:16,562 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 66 treesize of output 28 [2025-03-08 16:14:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:16,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:16,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:16,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134481272] [2025-03-08 16:14:16,576 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:14:16,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861129070] [2025-03-08 16:14:16,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861129070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:16,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:16,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:14:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981917097] [2025-03-08 16:14:16,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:16,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:16,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:16,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:16,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:16,577 INFO L87 Difference]: Start difference. First operand 328 states and 353 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:16,809 INFO L93 Difference]: Finished difference Result 647 states and 697 transitions. [2025-03-08 16:14:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:14:16,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2025-03-08 16:14:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:16,811 INFO L225 Difference]: With dead ends: 647 [2025-03-08 16:14:16,811 INFO L226 Difference]: Without dead ends: 430 [2025-03-08 16:14:16,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:14:16,812 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:16,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 384 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:14:16,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-08 16:14:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 321. [2025-03-08 16:14:16,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 268 states have (on average 1.0485074626865671) internal successors, (281), 268 states have internal predecessors, (281), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:14:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 345 transitions. [2025-03-08 16:14:16,864 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 345 transitions. Word has length 138 [2025-03-08 16:14:16,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:16,864 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 345 transitions. [2025-03-08 16:14:16,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 345 transitions. [2025-03-08 16:14:16,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:14:16,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:16,865 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:16,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 16:14:17,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-08 16:14:17,066 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:17,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash -480477584, now seen corresponding path program 1 times [2025-03-08 16:14:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:17,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701248178] [2025-03-08 16:14:17,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:17,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:17,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:14:17,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:14:17,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:17,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:17,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:17,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701248178] [2025-03-08 16:14:17,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701248178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:17,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:17,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:14:17,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618532139] [2025-03-08 16:14:17,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:17,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:14:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:17,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:14:17,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:14:17,865 INFO L87 Difference]: Start difference. First operand 321 states and 345 transitions. Second operand has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:14:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:18,190 INFO L93 Difference]: Finished difference Result 374 states and 399 transitions. [2025-03-08 16:14:18,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:14:18,191 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2025-03-08 16:14:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:18,192 INFO L225 Difference]: With dead ends: 374 [2025-03-08 16:14:18,192 INFO L226 Difference]: Without dead ends: 372 [2025-03-08 16:14:18,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:14:18,193 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 29 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:18,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1421 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:14:18,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-08 16:14:18,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 353. [2025-03-08 16:14:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 300 states have (on average 1.0466666666666666) internal successors, (314), 300 states have internal predecessors, (314), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:14:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 378 transitions. [2025-03-08 16:14:18,246 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 378 transitions. Word has length 142 [2025-03-08 16:14:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:18,246 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 378 transitions. [2025-03-08 16:14:18,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:14:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 378 transitions. [2025-03-08 16:14:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:14:18,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:18,247 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:18,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 16:14:18,247 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:18,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:18,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2007035249, now seen corresponding path program 1 times [2025-03-08 16:14:18,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:18,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039776833] [2025-03-08 16:14:18,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:18,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:18,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:14:18,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:14:18,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:18,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:18,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:18,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039776833] [2025-03-08 16:14:18,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039776833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:18,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:18,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:14:18,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091995134] [2025-03-08 16:14:18,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:18,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:14:18,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:18,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:14:18,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:14:18,566 INFO L87 Difference]: Start difference. First operand 353 states and 378 transitions. Second operand has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:14:18,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:18,711 INFO L93 Difference]: Finished difference Result 629 states and 671 transitions. [2025-03-08 16:14:18,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:14:18,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 142 [2025-03-08 16:14:18,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:18,713 INFO L225 Difference]: With dead ends: 629 [2025-03-08 16:14:18,713 INFO L226 Difference]: Without dead ends: 387 [2025-03-08 16:14:18,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:14:18,714 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 23 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:18,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 618 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:14:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-08 16:14:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 353. [2025-03-08 16:14:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 300 states have (on average 1.0433333333333332) internal successors, (313), 300 states have internal predecessors, (313), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:14:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 377 transitions. [2025-03-08 16:14:18,767 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 377 transitions. Word has length 142 [2025-03-08 16:14:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:18,767 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 377 transitions. [2025-03-08 16:14:18,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 16:14:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 377 transitions. [2025-03-08 16:14:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:14:18,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:18,767 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:18,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 16:14:18,767 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:18,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:18,768 INFO L85 PathProgramCache]: Analyzing trace with hash -469161457, now seen corresponding path program 1 times [2025-03-08 16:14:18,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:18,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994688038] [2025-03-08 16:14:18,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:18,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:18,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:14:18,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:14:18,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:18,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:19,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:19,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994688038] [2025-03-08 16:14:19,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994688038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:19,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:19,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:14:19,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652815563] [2025-03-08 16:14:19,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:19,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:19,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:19,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:19,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:19,043 INFO L87 Difference]: Start difference. First operand 353 states and 377 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:14:19,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:19,162 INFO L93 Difference]: Finished difference Result 610 states and 650 transitions. [2025-03-08 16:14:19,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:14:19,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2025-03-08 16:14:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:19,164 INFO L225 Difference]: With dead ends: 610 [2025-03-08 16:14:19,164 INFO L226 Difference]: Without dead ends: 368 [2025-03-08 16:14:19,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:14:19,166 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 41 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:19,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 472 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:14:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-08 16:14:19,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 353. [2025-03-08 16:14:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 300 states have (on average 1.04) internal successors, (312), 300 states have internal predecessors, (312), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:14:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 376 transitions. [2025-03-08 16:14:19,229 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 376 transitions. Word has length 142 [2025-03-08 16:14:19,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:19,229 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 376 transitions. [2025-03-08 16:14:19,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:14:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 376 transitions. [2025-03-08 16:14:19,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:14:19,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:19,230 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:19,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 16:14:19,230 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:19,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:19,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2018351376, now seen corresponding path program 1 times [2025-03-08 16:14:19,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:19,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108717572] [2025-03-08 16:14:19,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:19,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:19,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:14:19,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:14:19,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:19,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:14:19,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:19,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108717572] [2025-03-08 16:14:19,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108717572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:19,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:19,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:14:19,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607832036] [2025-03-08 16:14:19,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:19,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:14:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:19,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:14:19,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:14:19,547 INFO L87 Difference]: Start difference. First operand 353 states and 376 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:19,812 INFO L93 Difference]: Finished difference Result 460 states and 498 transitions. [2025-03-08 16:14:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:14:19,812 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 142 [2025-03-08 16:14:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:19,813 INFO L225 Difference]: With dead ends: 460 [2025-03-08 16:14:19,813 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 16:14:19,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-08 16:14:19,814 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 80 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:19,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1904 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:14:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 16:14:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 16:14:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 16:14:19,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 16:14:19,815 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2025-03-08 16:14:19,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:19,815 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 16:14:19,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:14:19,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 16:14:19,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 16:14:19,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:14:19,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 16:14:19,821 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:14:19,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.