./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-ap_file-62.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 c9ea8f5132fafef47c5cde74633ce85a3773c3d65cff180ef26fe244a046ff77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:37:20,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:37:20,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:37:20,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:37:20,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:37:20,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:37:20,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:37:20,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:37:20,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:37:20,565 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:37:20,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:37:20,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:37:20,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:37:20,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:37:20,566 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:37:20,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:37:20,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:37:20,567 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:37:20,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:37:20,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:37:20,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:37:20,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:37:20,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:37:20,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:37:20,567 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:37:20,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:37:20,567 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:37:20,567 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:37:20,568 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:37:20,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:37:20,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:37:20,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:37:20,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:37:20,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:37:20,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:37:20,569 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:37:20,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:37:20,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:37:20,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:37:20,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:37:20,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:37:20,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:37:20,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:37:20,569 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 -> c9ea8f5132fafef47c5cde74633ce85a3773c3d65cff180ef26fe244a046ff77 [2025-03-17 05:37:20,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:37:20,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:37:20,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:37:20,806 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:37:20,807 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:37:20,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2025-03-17 05:37:22,036 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c07e160b/af5e5d911aa9487badf6fae3acdb50c9/FLAG3bc9b808c [2025-03-17 05:37:22,280 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:37:22,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2025-03-17 05:37:22,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c07e160b/af5e5d911aa9487badf6fae3acdb50c9/FLAG3bc9b808c [2025-03-17 05:37:22,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c07e160b/af5e5d911aa9487badf6fae3acdb50c9 [2025-03-17 05:37:22,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:37:22,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:37:22,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:37:22,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:37:22,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:37:22,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:37:22" (1/1) ... [2025-03-17 05:37:22,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d44e847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22, skipping insertion in model container [2025-03-17 05:37:22,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:37:22" (1/1) ... [2025-03-17 05:37:22,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:37:22,735 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-ap_file-62.i[917,930] [2025-03-17 05:37:22,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:37:22,792 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:37:22,798 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-ap_file-62.i[917,930] [2025-03-17 05:37:22,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:37:22,842 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:37:22,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22 WrapperNode [2025-03-17 05:37:22,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:37:22,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:37:22,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:37:22,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:37:22,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22" (1/1) ... [2025-03-17 05:37:22,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22" (1/1) ... [2025-03-17 05:37:22,891 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 337 [2025-03-17 05:37:22,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:37:22,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:37:22,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:37:22,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:37:22,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22" (1/1) ... [2025-03-17 05:37:22,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22" (1/1) ... [2025-03-17 05:37:22,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22" (1/1) ... [2025-03-17 05:37:22,926 INFO L175 MemorySlicer]: Split 87 memory accesses to 6 slices as follows [2, 10, 29, 26, 4, 16]. 33 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 3, 1, 2]. The 14 writes are split as follows [0, 1, 4, 6, 1, 2]. [2025-03-17 05:37:22,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22" (1/1) ... [2025-03-17 05:37:22,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22" (1/1) ... [2025-03-17 05:37:22,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22" (1/1) ... [2025-03-17 05:37:22,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22" (1/1) ... [2025-03-17 05:37:22,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22" (1/1) ... [2025-03-17 05:37:22,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22" (1/1) ... [2025-03-17 05:37:22,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:37:22,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:37:22,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:37:22,949 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:37:22,950 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22" (1/1) ... [2025-03-17 05:37:22,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:37:22,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:37:22,977 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-17 05:37:22,979 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-17 05:37:22,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:37:22,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:37:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:37:23,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:37:23,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:37:23,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:37:23,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:37:23,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:37:23,119 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:37:23,121 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:37:23,418 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem40#1;havoc property_#t~mem41#1;havoc property_#t~ite48#1;havoc property_#t~mem42#1;havoc property_#t~mem47#1;havoc property_#t~mem43#1;havoc property_#t~ite46#1;havoc property_#t~mem44#1;havoc property_#t~mem45#1;havoc property_#t~short49#1;havoc property_#t~mem50#1;havoc property_#t~mem51#1;havoc property_#t~ite59#1;havoc property_#t~mem52#1;havoc property_#t~ite58#1;havoc property_#t~mem53#1;havoc property_#t~mem54#1;havoc property_#t~ite57#1;havoc property_#t~mem56#1;havoc property_#t~mem55#1;havoc property_#t~short60#1;havoc property_#t~mem61#1;havoc property_#t~ite75#1;havoc property_#t~mem62#1;havoc property_#t~ite71#1;havoc property_#t~mem65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem66#1;havoc property_#t~ite70#1;havoc property_#t~mem67#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~short76#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~short79#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~short82#1; [2025-03-17 05:37:23,446 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2025-03-17 05:37:23,446 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:37:23,455 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:37:23,455 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:37:23,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:37:23 BoogieIcfgContainer [2025-03-17 05:37:23,456 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:37:23,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:37:23,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:37:23,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:37:23,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:37:22" (1/3) ... [2025-03-17 05:37:23,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42222011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:37:23, skipping insertion in model container [2025-03-17 05:37:23,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:37:22" (2/3) ... [2025-03-17 05:37:23,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42222011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:37:23, skipping insertion in model container [2025-03-17 05:37:23,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:37:23" (3/3) ... [2025-03-17 05:37:23,465 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-62.i [2025-03-17 05:37:23,479 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:37:23,481 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-62.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:37:23,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:37:23,545 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;@144e2999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:37:23,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:37:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 05:37:23,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:37:23,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:23,556 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:23,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:23,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1712331806, now seen corresponding path program 1 times [2025-03-17 05:37:23,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:23,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498022583] [2025-03-17 05:37:23,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:23,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:23,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:37:23,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:37:23,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:23,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:23,795 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-17 05:37:23,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:23,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498022583] [2025-03-17 05:37:23,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498022583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:23,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310828557] [2025-03-17 05:37:23,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:23,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:37:23,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:37:23,807 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-17 05:37:23,813 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-17 05:37:23,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:37:23,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:37:23,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:23,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:23,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:37:24,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-17 05:37:24,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:37:24,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310828557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:24,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:37:24,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:37:24,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385759089] [2025-03-17 05:37:24,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:24,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:37:24,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:24,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:37:24,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:37:24,043 INFO L87 Difference]: Start difference. First operand has 67 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 05:37:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:24,061 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2025-03-17 05:37:24,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:37:24,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2025-03-17 05:37:24,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:24,067 INFO L225 Difference]: With dead ends: 131 [2025-03-17 05:37:24,067 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 05:37:24,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 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-17 05:37:24,071 INFO L435 NwaCegarLoop]: 93 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, 93 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-17 05:37:24,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:37:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 05:37:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 05:37:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 05:37:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2025-03-17 05:37:24,102 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 69 [2025-03-17 05:37:24,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:24,102 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2025-03-17 05:37:24,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 05:37:24,103 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2025-03-17 05:37:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:37:24,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:24,105 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:24,113 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-17 05:37:24,306 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-17 05:37:24,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:24,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:24,307 INFO L85 PathProgramCache]: Analyzing trace with hash 775201062, now seen corresponding path program 1 times [2025-03-17 05:37:24,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:24,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197766460] [2025-03-17 05:37:24,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:24,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:24,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:37:24,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:37:24,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:24,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:37:24,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:24,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197766460] [2025-03-17 05:37:24,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197766460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:24,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:24,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:37:24,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45127116] [2025-03-17 05:37:24,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:24,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:37:24,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:24,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:37:24,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:37:24,534 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:24,572 INFO L93 Difference]: Finished difference Result 132 states and 189 transitions. [2025-03-17 05:37:24,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:37:24,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2025-03-17 05:37:24,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:24,574 INFO L225 Difference]: With dead ends: 132 [2025-03-17 05:37:24,574 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 05:37:24,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:37:24,575 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:24,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 259 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:37:24,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 05:37:24,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2025-03-17 05:37:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 05:37:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2025-03-17 05:37:24,584 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 69 [2025-03-17 05:37:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:24,585 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2025-03-17 05:37:24,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2025-03-17 05:37:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:37:24,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:24,587 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:24,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:37:24,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:24,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:24,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1662704743, now seen corresponding path program 1 times [2025-03-17 05:37:24,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:24,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557549833] [2025-03-17 05:37:24,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:24,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:24,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:37:24,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:37:24,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:24,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:37:24,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:24,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557549833] [2025-03-17 05:37:24,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557549833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:24,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:24,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:37:24,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028818316] [2025-03-17 05:37:24,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:24,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:37:24,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:24,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:37:24,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:37:24,729 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:24,759 INFO L93 Difference]: Finished difference Result 136 states and 193 transitions. [2025-03-17 05:37:24,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:37:24,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2025-03-17 05:37:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:24,761 INFO L225 Difference]: With dead ends: 136 [2025-03-17 05:37:24,761 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 05:37:24,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:37:24,762 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:24,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 262 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:37:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 05:37:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-03-17 05:37:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 05:37:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2025-03-17 05:37:24,794 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 69 [2025-03-17 05:37:24,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:24,795 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2025-03-17 05:37:24,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2025-03-17 05:37:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:37:24,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:24,795 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:24,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:37:24,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:24,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:24,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1663628264, now seen corresponding path program 1 times [2025-03-17 05:37:24,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:24,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137565986] [2025-03-17 05:37:24,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:24,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:24,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:37:24,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:37:24,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:24,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:37:25,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:25,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137565986] [2025-03-17 05:37:25,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137565986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:25,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:25,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:37:25,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083493130] [2025-03-17 05:37:25,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:25,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:37:25,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:25,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:37:25,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:25,153 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:25,278 INFO L93 Difference]: Finished difference Result 146 states and 203 transitions. [2025-03-17 05:37:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:25,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2025-03-17 05:37:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:25,279 INFO L225 Difference]: With dead ends: 146 [2025-03-17 05:37:25,279 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 05:37:25,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:37:25,280 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 79 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:25,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 186 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 05:37:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2025-03-17 05:37:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.328125) internal successors, (85), 65 states have internal predecessors, (85), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 05:37:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2025-03-17 05:37:25,292 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 69 [2025-03-17 05:37:25,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:25,292 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2025-03-17 05:37:25,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:25,294 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2025-03-17 05:37:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 05:37:25,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:25,297 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:25,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:37:25,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:25,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:25,297 INFO L85 PathProgramCache]: Analyzing trace with hash 487718086, now seen corresponding path program 1 times [2025-03-17 05:37:25,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:25,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711617876] [2025-03-17 05:37:25,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:25,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:25,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 05:37:25,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 05:37:25,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:25,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:37:25,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:25,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711617876] [2025-03-17 05:37:25,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711617876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:25,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:25,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:37:25,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505785350] [2025-03-17 05:37:25,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:25,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:37:25,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:25,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:37:25,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:25,552 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:25,694 INFO L93 Difference]: Finished difference Result 201 states and 272 transitions. [2025-03-17 05:37:25,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:37:25,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 71 [2025-03-17 05:37:25,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:25,697 INFO L225 Difference]: With dead ends: 201 [2025-03-17 05:37:25,697 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 05:37:25,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:37:25,698 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 59 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:25,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 498 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 05:37:25,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 87. [2025-03-17 05:37:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.337837837837838) internal successors, (99), 75 states have internal predecessors, (99), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 05:37:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2025-03-17 05:37:25,711 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 71 [2025-03-17 05:37:25,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:25,711 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2025-03-17 05:37:25,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2025-03-17 05:37:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 05:37:25,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:25,716 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:25,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:37:25,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:25,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:25,717 INFO L85 PathProgramCache]: Analyzing trace with hash -663888823, now seen corresponding path program 1 times [2025-03-17 05:37:25,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:25,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847077488] [2025-03-17 05:37:25,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:25,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:25,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 05:37:25,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 05:37:25,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:25,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:37:25,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:25,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847077488] [2025-03-17 05:37:25,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847077488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:25,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:25,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:37:25,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840152604] [2025-03-17 05:37:25,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:25,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:25,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:25,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:25,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:37:25,935 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:26,006 INFO L93 Difference]: Finished difference Result 203 states and 276 transitions. [2025-03-17 05:37:26,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:26,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-03-17 05:37:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:26,009 INFO L225 Difference]: With dead ends: 203 [2025-03-17 05:37:26,009 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 05:37:26,010 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-17 05:37:26,010 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 48 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:26,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 462 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 05:37:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 87. [2025-03-17 05:37:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 05:37:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2025-03-17 05:37:26,027 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 73 [2025-03-17 05:37:26,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:26,028 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2025-03-17 05:37:26,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:26,028 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2025-03-17 05:37:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 05:37:26,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:26,030 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:26,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:37:26,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:26,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:26,030 INFO L85 PathProgramCache]: Analyzing trace with hash 709532292, now seen corresponding path program 1 times [2025-03-17 05:37:26,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:26,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544537325] [2025-03-17 05:37:26,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:26,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:26,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 05:37:26,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 05:37:26,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:26,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:37:26,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:26,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544537325] [2025-03-17 05:37:26,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544537325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:26,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:26,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:37:26,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019047583] [2025-03-17 05:37:26,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:26,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:26,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:26,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:26,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:37:26,218 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:26,271 INFO L93 Difference]: Finished difference Result 198 states and 267 transitions. [2025-03-17 05:37:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:26,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-03-17 05:37:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:26,273 INFO L225 Difference]: With dead ends: 198 [2025-03-17 05:37:26,273 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 05:37:26,274 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-17 05:37:26,275 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 43 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:26,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 322 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:37:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 05:37:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 87. [2025-03-17 05:37:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 75 states have internal predecessors, (97), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 05:37:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2025-03-17 05:37:26,289 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 73 [2025-03-17 05:37:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:26,289 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2025-03-17 05:37:26,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2025-03-17 05:37:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 05:37:26,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:26,293 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:26,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:37:26,294 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:26,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:26,294 INFO L85 PathProgramCache]: Analyzing trace with hash -479257091, now seen corresponding path program 1 times [2025-03-17 05:37:26,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:26,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463416009] [2025-03-17 05:37:26,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:26,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 05:37:26,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 05:37:26,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:26,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-17 05:37:26,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:26,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463416009] [2025-03-17 05:37:26,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463416009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:26,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622978498] [2025-03-17 05:37:26,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:26,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:37:26,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:37:26,469 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-17 05:37:26,477 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-17 05:37:26,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 05:37:26,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 05:37:26,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:26,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:26,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:37:26,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:37:26,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:37:26,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622978498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:26,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:37:26,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:37:26,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481809292] [2025-03-17 05:37:26,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:26,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:26,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:26,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:26,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:37:26,651 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:26,678 INFO L93 Difference]: Finished difference Result 172 states and 231 transitions. [2025-03-17 05:37:26,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:26,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-03-17 05:37:26,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:26,680 INFO L225 Difference]: With dead ends: 172 [2025-03-17 05:37:26,681 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 05:37:26,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 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-17 05:37:26,681 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:26,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:37:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 05:37:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 05:37:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 78 states have internal predecessors, (100), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 05:37:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2025-03-17 05:37:26,691 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 120 transitions. Word has length 73 [2025-03-17 05:37:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:26,691 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 120 transitions. [2025-03-17 05:37:26,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2025-03-17 05:37:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 05:37:26,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:26,692 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:26,700 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-17 05:37:26,892 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,SelfDestructingSolverStorable7 [2025-03-17 05:37:26,893 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:26,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:26,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2116855111, now seen corresponding path program 1 times [2025-03-17 05:37:26,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:26,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347630373] [2025-03-17 05:37:26,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:26,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:26,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:37:26,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:37:26,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:26,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:27,137 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:37:27,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:27,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347630373] [2025-03-17 05:37:27,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347630373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:27,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:27,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:37:27,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496670211] [2025-03-17 05:37:27,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:27,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:37:27,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:27,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:37:27,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:37:27,140 INFO L87 Difference]: Start difference. First operand 90 states and 120 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:27,329 INFO L93 Difference]: Finished difference Result 232 states and 304 transitions. [2025-03-17 05:37:27,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:37:27,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2025-03-17 05:37:27,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:27,331 INFO L225 Difference]: With dead ends: 232 [2025-03-17 05:37:27,331 INFO L226 Difference]: Without dead ends: 147 [2025-03-17 05:37:27,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:37:27,331 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 128 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:27,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 453 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:27,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-17 05:37:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 95. [2025-03-17 05:37:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 05:37:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2025-03-17 05:37:27,337 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 75 [2025-03-17 05:37:27,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:27,338 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2025-03-17 05:37:27,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2025-03-17 05:37:27,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 05:37:27,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:27,338 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:27,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:37:27,339 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:27,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:27,339 INFO L85 PathProgramCache]: Analyzing trace with hash 609303302, now seen corresponding path program 1 times [2025-03-17 05:37:27,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:27,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343943660] [2025-03-17 05:37:27,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:27,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:27,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:37:27,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:37:27,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:27,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-17 05:37:28,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:28,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343943660] [2025-03-17 05:37:28,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343943660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:28,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710590420] [2025-03-17 05:37:28,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:28,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:37:28,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:37:28,621 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-17 05:37:28,623 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-17 05:37:28,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:37:28,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:37:28,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:28,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:28,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:37:28,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:29,057 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-17 05:37:29,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:29,352 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-17 05:37:29,395 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 15 treesize of output 7 [2025-03-17 05:37:29,451 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 15 treesize of output 7 [2025-03-17 05:37:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 73 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 05:37:29,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:37:29,572 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 21 treesize of output 13 [2025-03-17 05:37:29,607 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 34 treesize of output 30 [2025-03-17 05:37:33,649 WARN L851 $PredicateComparison]: unable to prove that (forall ((~last_1_signed_char_Array_0_2_~0 Int) (v_z_1 Int)) (or (< v_z_1 0) (< 255 v_z_1) (< 0 (+ (select (select (store |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base (store (select |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset (+ (* (- 1) ~last_1_signed_char_Array_0_2_~0) (* (- 1) v_z_1) (select (select |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)))) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset) 1)))) is different from false [2025-03-17 05:37:33,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710590420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:33,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:37:33,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 27 [2025-03-17 05:37:33,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945531081] [2025-03-17 05:37:33,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:37:33,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 05:37:33,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:33,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 05:37:33,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=853, Unknown=1, NotChecked=58, Total=992 [2025-03-17 05:37:33,744 INFO L87 Difference]: Start difference. First operand 95 states and 126 transitions. Second operand has 27 states, 25 states have (on average 3.0) internal successors, (75), 26 states have internal predecessors, (75), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-17 05:37:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:39,767 INFO L93 Difference]: Finished difference Result 303 states and 386 transitions. [2025-03-17 05:37:39,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 05:37:39,769 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.0) internal successors, (75), 26 states have internal predecessors, (75), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 75 [2025-03-17 05:37:39,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:39,769 INFO L225 Difference]: With dead ends: 303 [2025-03-17 05:37:39,770 INFO L226 Difference]: Without dead ends: 209 [2025-03-17 05:37:39,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=590, Invalid=3319, Unknown=1, NotChecked=122, Total=4032 [2025-03-17 05:37:39,773 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 895 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:39,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 1318 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-17 05:37:39,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-17 05:37:39,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 108. [2025-03-17 05:37:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.263157894736842) internal successors, (120), 95 states have internal predecessors, (120), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 05:37:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 136 transitions. [2025-03-17 05:37:39,784 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 136 transitions. Word has length 75 [2025-03-17 05:37:39,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:39,785 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 136 transitions. [2025-03-17 05:37:39,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.0) internal successors, (75), 26 states have internal predecessors, (75), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-17 05:37:39,785 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 136 transitions. [2025-03-17 05:37:39,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 05:37:39,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:39,786 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:39,793 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-17 05:37:39,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:37:39,987 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:39,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:39,987 INFO L85 PathProgramCache]: Analyzing trace with hash 78798822, now seen corresponding path program 1 times [2025-03-17 05:37:39,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:39,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770462510] [2025-03-17 05:37:39,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:39,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:40,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:37:40,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:37:40,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:40,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:37:41,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:41,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770462510] [2025-03-17 05:37:41,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770462510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:41,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:41,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 05:37:41,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994373624] [2025-03-17 05:37:41,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:41,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:37:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:41,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:37:41,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:37:41,448 INFO L87 Difference]: Start difference. First operand 108 states and 136 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 05:37:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:43,996 INFO L93 Difference]: Finished difference Result 600 states and 751 transitions. [2025-03-17 05:37:44,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 05:37:44,001 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2025-03-17 05:37:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:44,004 INFO L225 Difference]: With dead ends: 600 [2025-03-17 05:37:44,004 INFO L226 Difference]: Without dead ends: 493 [2025-03-17 05:37:44,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=290, Invalid=1116, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 05:37:44,006 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 949 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:44,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1074 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 05:37:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-17 05:37:44,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 233. [2025-03-17 05:37:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 208 states have (on average 1.2740384615384615) internal successors, (265), 208 states have internal predecessors, (265), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:37:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 297 transitions. [2025-03-17 05:37:44,044 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 297 transitions. Word has length 75 [2025-03-17 05:37:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:44,044 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 297 transitions. [2025-03-17 05:37:44,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 05:37:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 297 transitions. [2025-03-17 05:37:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 05:37:44,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:44,045 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:44,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:37:44,045 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:44,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:44,045 INFO L85 PathProgramCache]: Analyzing trace with hash -186340413, now seen corresponding path program 1 times [2025-03-17 05:37:44,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:44,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555699117] [2025-03-17 05:37:44,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:44,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:44,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:37:44,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:37:44,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:44,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-17 05:37:44,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:44,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555699117] [2025-03-17 05:37:44,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555699117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:44,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052349880] [2025-03-17 05:37:44,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:44,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:37:44,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:37:44,222 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-17 05:37:44,224 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-17 05:37:44,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:37:44,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:37:44,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:44,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:44,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:37:44,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:44,449 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 19 treesize of output 11 [2025-03-17 05:37:44,457 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 15 treesize of output 7 [2025-03-17 05:37:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:37:44,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:37:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052349880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:44,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:37:44,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-17 05:37:44,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439657534] [2025-03-17 05:37:44,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:44,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:44,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:44,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:44,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:37:44,499 INFO L87 Difference]: Start difference. First operand 233 states and 297 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:44,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:44,736 INFO L93 Difference]: Finished difference Result 554 states and 701 transitions. [2025-03-17 05:37:44,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:44,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2025-03-17 05:37:44,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:44,738 INFO L225 Difference]: With dead ends: 554 [2025-03-17 05:37:44,738 INFO L226 Difference]: Without dead ends: 322 [2025-03-17 05:37:44,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:37:44,739 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 40 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:44,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 278 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:37:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-17 05:37:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 256. [2025-03-17 05:37:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 231 states have (on average 1.2554112554112553) internal successors, (290), 231 states have internal predecessors, (290), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:37:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 322 transitions. [2025-03-17 05:37:44,767 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 322 transitions. Word has length 75 [2025-03-17 05:37:44,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:44,767 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 322 transitions. [2025-03-17 05:37:44,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:44,768 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 322 transitions. [2025-03-17 05:37:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 05:37:44,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:44,768 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:44,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:37:44,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:37:44,969 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:44,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:44,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1792938190, now seen corresponding path program 1 times [2025-03-17 05:37:44,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:44,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721969549] [2025-03-17 05:37:44,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:44,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:44,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:37:45,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:37:45,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:45,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:37:45,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:45,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721969549] [2025-03-17 05:37:45,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721969549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:45,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:45,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:37:45,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609390550] [2025-03-17 05:37:45,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:45,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:37:45,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:45,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:37:45,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:37:45,715 INFO L87 Difference]: Start difference. First operand 256 states and 322 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:46,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:46,211 INFO L93 Difference]: Finished difference Result 289 states and 356 transitions. [2025-03-17 05:37:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:37:46,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2025-03-17 05:37:46,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:46,214 INFO L225 Difference]: With dead ends: 289 [2025-03-17 05:37:46,214 INFO L226 Difference]: Without dead ends: 287 [2025-03-17 05:37:46,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:37:46,215 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 88 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:46,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 376 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:37:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-17 05:37:46,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2025-03-17 05:37:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 253 states have (on average 1.233201581027668) internal successors, (312), 254 states have internal predecessors, (312), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:37:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 352 transitions. [2025-03-17 05:37:46,244 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 352 transitions. Word has length 75 [2025-03-17 05:37:46,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:46,244 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 352 transitions. [2025-03-17 05:37:46,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 352 transitions. [2025-03-17 05:37:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 05:37:46,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:46,245 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:46,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:37:46,246 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:46,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1792014669, now seen corresponding path program 1 times [2025-03-17 05:37:46,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:46,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438664618] [2025-03-17 05:37:46,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:46,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:46,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:37:46,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:37:46,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:46,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:37:46,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:46,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438664618] [2025-03-17 05:37:46,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438664618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:46,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:46,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:37:46,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35337011] [2025-03-17 05:37:46,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:46,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:37:46,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:46,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:37:46,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:37:46,483 INFO L87 Difference]: Start difference. First operand 286 states and 352 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 05:37:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:46,691 INFO L93 Difference]: Finished difference Result 556 states and 686 transitions. [2025-03-17 05:37:46,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:37:46,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2025-03-17 05:37:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:46,693 INFO L225 Difference]: With dead ends: 556 [2025-03-17 05:37:46,693 INFO L226 Difference]: Without dead ends: 287 [2025-03-17 05:37:46,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:37:46,694 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 126 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:46,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 290 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:46,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-17 05:37:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2025-03-17 05:37:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 253 states have (on average 1.225296442687747) internal successors, (310), 254 states have internal predecessors, (310), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:37:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 350 transitions. [2025-03-17 05:37:46,727 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 350 transitions. Word has length 75 [2025-03-17 05:37:46,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:46,728 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 350 transitions. [2025-03-17 05:37:46,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 05:37:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 350 transitions. [2025-03-17 05:37:46,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 05:37:46,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:46,729 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:46,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:37:46,729 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:46,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:46,729 INFO L85 PathProgramCache]: Analyzing trace with hash -904510988, now seen corresponding path program 1 times [2025-03-17 05:37:46,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:46,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539398257] [2025-03-17 05:37:46,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:46,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:46,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:37:46,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:37:46,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:46,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:37:47,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:47,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539398257] [2025-03-17 05:37:47,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539398257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:47,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:47,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:37:47,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367422318] [2025-03-17 05:37:47,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:47,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:37:47,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:47,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:37:47,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:37:47,303 INFO L87 Difference]: Start difference. First operand 286 states and 350 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:48,177 INFO L93 Difference]: Finished difference Result 731 states and 902 transitions. [2025-03-17 05:37:48,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:37:48,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2025-03-17 05:37:48,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:48,181 INFO L225 Difference]: With dead ends: 731 [2025-03-17 05:37:48,181 INFO L226 Difference]: Without dead ends: 462 [2025-03-17 05:37:48,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:37:48,184 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 233 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:48,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 381 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:37:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-17 05:37:48,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 418. [2025-03-17 05:37:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 385 states have (on average 1.2415584415584415) internal successors, (478), 386 states have internal predecessors, (478), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:37:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 518 transitions. [2025-03-17 05:37:48,222 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 518 transitions. Word has length 75 [2025-03-17 05:37:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:48,223 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 518 transitions. [2025-03-17 05:37:48,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:37:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 518 transitions. [2025-03-17 05:37:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 05:37:48,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:48,225 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:48,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:37:48,225 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:48,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:48,226 INFO L85 PathProgramCache]: Analyzing trace with hash -275396613, now seen corresponding path program 1 times [2025-03-17 05:37:48,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:48,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888783405] [2025-03-17 05:37:48,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:48,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:48,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 05:37:48,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 05:37:48,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:48,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-17 05:37:49,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:49,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888783405] [2025-03-17 05:37:49,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888783405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:49,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791538678] [2025-03-17 05:37:49,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:49,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:37:49,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:37:49,448 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-17 05:37:49,449 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-17 05:37:49,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 05:37:49,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 05:37:49,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:49,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:49,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-17 05:37:49,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:50,519 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-17 05:37:51,173 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-17 05:37:52,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:52,707 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-17 05:37:52,770 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-17 05:37:52,879 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-17 05:37:52,941 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 15 treesize of output 7 [2025-03-17 05:37:52,950 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 15 treesize of output 7 [2025-03-17 05:37:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 92 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 05:37:53,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:37:53,404 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 60 treesize of output 56 [2025-03-17 05:37:57,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791538678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:57,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:37:57,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2025-03-17 05:37:57,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864445090] [2025-03-17 05:37:57,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:37:57,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 05:37:57,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:57,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 05:37:57,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2025-03-17 05:37:57,923 INFO L87 Difference]: Start difference. First operand 418 states and 518 transitions. Second operand has 27 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 8 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-17 05:37:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:59,900 INFO L93 Difference]: Finished difference Result 764 states and 958 transitions. [2025-03-17 05:37:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:37:59,901 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 8 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 8 states have call successors, (16) Word has length 76 [2025-03-17 05:37:59,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:59,903 INFO L225 Difference]: With dead ends: 764 [2025-03-17 05:37:59,903 INFO L226 Difference]: Without dead ends: 363 [2025-03-17 05:37:59,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=356, Invalid=1450, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 05:37:59,909 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 367 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:59,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 402 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 05:37:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-17 05:37:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 353. [2025-03-17 05:37:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 320 states have (on average 1.25) internal successors, (400), 321 states have internal predecessors, (400), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:37:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 440 transitions. [2025-03-17 05:37:59,942 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 440 transitions. Word has length 76 [2025-03-17 05:37:59,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:59,943 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 440 transitions. [2025-03-17 05:37:59,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 8 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-17 05:37:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 440 transitions. [2025-03-17 05:37:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 05:37:59,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:59,945 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:37:59,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 05:38:00,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 05:38:00,149 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:00,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:00,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1012558648, now seen corresponding path program 1 times [2025-03-17 05:38:00,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:38:00,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766956165] [2025-03-17 05:38:00,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:00,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:38:00,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 05:38:00,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 05:38:00,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:00,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:38:00,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:38:00,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766956165] [2025-03-17 05:38:00,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766956165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:00,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:00,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:38:00,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806827968] [2025-03-17 05:38:00,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:00,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:38:00,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:38:00,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:38:00,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:38:00,475 INFO L87 Difference]: Start difference. First operand 353 states and 440 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 05:38:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:00,987 INFO L93 Difference]: Finished difference Result 811 states and 1012 transitions. [2025-03-17 05:38:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:38:00,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2025-03-17 05:38:00,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:00,990 INFO L225 Difference]: With dead ends: 811 [2025-03-17 05:38:00,990 INFO L226 Difference]: Without dead ends: 475 [2025-03-17 05:38:00,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:38:00,991 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 198 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:00,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 514 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:38:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-17 05:38:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 353. [2025-03-17 05:38:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 320 states have (on average 1.23125) internal successors, (394), 321 states have internal predecessors, (394), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:38:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 434 transitions. [2025-03-17 05:38:01,025 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 434 transitions. Word has length 76 [2025-03-17 05:38:01,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:01,025 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 434 transitions. [2025-03-17 05:38:01,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 05:38:01,025 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 434 transitions. [2025-03-17 05:38:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 05:38:01,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:01,026 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:38:01,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:38:01,027 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:01,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:01,027 INFO L85 PathProgramCache]: Analyzing trace with hash 16406042, now seen corresponding path program 1 times [2025-03-17 05:38:01,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:38:01,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634225934] [2025-03-17 05:38:01,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:01,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:38:01,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 05:38:01,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 05:38:01,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:01,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-17 05:38:01,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:38:01,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634225934] [2025-03-17 05:38:01,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634225934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:38:01,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668638524] [2025-03-17 05:38:01,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:01,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:38:01,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:38:01,177 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-17 05:38:01,178 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-17 05:38:01,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 05:38:01,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 05:38:01,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:01,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:01,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:38:01,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:38:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:38:01,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:38:01,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668638524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:01,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:38:01,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-17 05:38:01,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579988962] [2025-03-17 05:38:01,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:01,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:38:01,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:38:01,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:38:01,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:38:01,333 INFO L87 Difference]: Start difference. First operand 353 states and 434 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:01,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:01,424 INFO L93 Difference]: Finished difference Result 705 states and 869 transitions. [2025-03-17 05:38:01,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:38:01,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2025-03-17 05:38:01,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:01,426 INFO L225 Difference]: With dead ends: 705 [2025-03-17 05:38:01,427 INFO L226 Difference]: Without dead ends: 369 [2025-03-17 05:38:01,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:38:01,428 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:01,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 414 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:38:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-17 05:38:01,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 357. [2025-03-17 05:38:01,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 324 states have (on average 1.228395061728395) internal successors, (398), 325 states have internal predecessors, (398), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:38:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 438 transitions. [2025-03-17 05:38:01,454 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 438 transitions. Word has length 76 [2025-03-17 05:38:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:01,454 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 438 transitions. [2025-03-17 05:38:01,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 438 transitions. [2025-03-17 05:38:01,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 05:38:01,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:01,455 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:38:01,462 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-17 05:38:01,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 05:38:01,656 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:01,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash 129986564, now seen corresponding path program 1 times [2025-03-17 05:38:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:38:01,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146302550] [2025-03-17 05:38:01,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:01,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:38:01,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 05:38:01,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 05:38:01,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:01,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:38:03,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:38:03,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146302550] [2025-03-17 05:38:03,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146302550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:03,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:03,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-17 05:38:03,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472714639] [2025-03-17 05:38:03,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:03,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 05:38:03,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:38:03,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 05:38:03,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:38:03,333 INFO L87 Difference]: Start difference. First operand 357 states and 438 transitions. Second operand has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 05:38:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:06,465 INFO L93 Difference]: Finished difference Result 1004 states and 1224 transitions. [2025-03-17 05:38:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 05:38:06,466 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 77 [2025-03-17 05:38:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:06,468 INFO L225 Difference]: With dead ends: 1004 [2025-03-17 05:38:06,468 INFO L226 Difference]: Without dead ends: 664 [2025-03-17 05:38:06,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=338, Invalid=1468, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 05:38:06,472 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 734 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:06,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1644 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 05:38:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-17 05:38:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 335. [2025-03-17 05:38:06,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 302 states have (on average 1.218543046357616) internal successors, (368), 303 states have internal predecessors, (368), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:38:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 408 transitions. [2025-03-17 05:38:06,505 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 408 transitions. Word has length 77 [2025-03-17 05:38:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:06,506 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 408 transitions. [2025-03-17 05:38:06,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 05:38:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 408 transitions. [2025-03-17 05:38:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 05:38:06,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:06,507 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:38:06,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:38:06,507 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:06,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:06,508 INFO L85 PathProgramCache]: Analyzing trace with hash -293809202, now seen corresponding path program 1 times [2025-03-17 05:38:06,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:38:06,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413101993] [2025-03-17 05:38:06,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:06,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:38:06,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 05:38:06,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 05:38:06,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:06,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:38:06,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:38:06,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413101993] [2025-03-17 05:38:06,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413101993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:06,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:06,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:38:06,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145157493] [2025-03-17 05:38:06,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:06,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:38:06,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:38:06,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:38:06,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:38:06,583 INFO L87 Difference]: Start difference. First operand 335 states and 408 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:06,699 INFO L93 Difference]: Finished difference Result 562 states and 680 transitions. [2025-03-17 05:38:06,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:38:06,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2025-03-17 05:38:06,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:06,700 INFO L225 Difference]: With dead ends: 562 [2025-03-17 05:38:06,701 INFO L226 Difference]: Without dead ends: 244 [2025-03-17 05:38:06,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:38:06,701 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:06,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:38:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-17 05:38:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-03-17 05:38:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 211 states have (on average 1.180094786729858) internal successors, (249), 212 states have internal predecessors, (249), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:38:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 289 transitions. [2025-03-17 05:38:06,727 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 289 transitions. Word has length 78 [2025-03-17 05:38:06,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:06,727 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 289 transitions. [2025-03-17 05:38:06,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:06,727 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 289 transitions. [2025-03-17 05:38:06,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 05:38:06,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:06,728 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:38:06,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:38:06,728 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:06,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:06,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1848912184, now seen corresponding path program 1 times [2025-03-17 05:38:06,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:38:06,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219490620] [2025-03-17 05:38:06,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:06,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:38:06,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 05:38:06,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 05:38:06,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:06,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:38:06,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:38:06,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219490620] [2025-03-17 05:38:06,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219490620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:06,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:06,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:38:06,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756889763] [2025-03-17 05:38:06,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:06,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:38:06,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:38:06,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:38:06,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:38:06,838 INFO L87 Difference]: Start difference. First operand 244 states and 289 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:06,945 INFO L93 Difference]: Finished difference Result 553 states and 658 transitions. [2025-03-17 05:38:06,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:38:06,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2025-03-17 05:38:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:06,947 INFO L225 Difference]: With dead ends: 553 [2025-03-17 05:38:06,947 INFO L226 Difference]: Without dead ends: 326 [2025-03-17 05:38:06,948 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-17 05:38:06,949 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 43 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:06,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 309 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:38:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-17 05:38:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 244. [2025-03-17 05:38:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 211 states have (on average 1.1706161137440758) internal successors, (247), 212 states have internal predecessors, (247), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:38:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 287 transitions. [2025-03-17 05:38:06,974 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 287 transitions. Word has length 78 [2025-03-17 05:38:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:06,974 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 287 transitions. [2025-03-17 05:38:06,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 287 transitions. [2025-03-17 05:38:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 05:38:06,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:06,974 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:38:06,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:38:06,975 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:06,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash -589758530, now seen corresponding path program 1 times [2025-03-17 05:38:06,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:38:06,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261292228] [2025-03-17 05:38:06,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:38:06,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 05:38:06,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 05:38:06,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:06,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:38:07,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:38:07,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261292228] [2025-03-17 05:38:07,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261292228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:07,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:07,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:38:07,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344070582] [2025-03-17 05:38:07,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:07,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:38:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:38:07,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:38:07,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:38:07,364 INFO L87 Difference]: Start difference. First operand 244 states and 287 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 05:38:07,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:07,955 INFO L93 Difference]: Finished difference Result 586 states and 683 transitions. [2025-03-17 05:38:07,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:38:07,959 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 79 [2025-03-17 05:38:07,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:07,960 INFO L225 Difference]: With dead ends: 586 [2025-03-17 05:38:07,960 INFO L226 Difference]: Without dead ends: 359 [2025-03-17 05:38:07,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:38:07,963 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:07,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 560 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:38:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-17 05:38:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 343. [2025-03-17 05:38:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 295 states have (on average 1.1559322033898305) internal successors, (341), 297 states have internal predecessors, (341), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:38:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 397 transitions. [2025-03-17 05:38:08,022 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 397 transitions. Word has length 79 [2025-03-17 05:38:08,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:08,022 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 397 transitions. [2025-03-17 05:38:08,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 05:38:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 397 transitions. [2025-03-17 05:38:08,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 05:38:08,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:08,023 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:38:08,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:38:08,023 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:08,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2021123667, now seen corresponding path program 1 times [2025-03-17 05:38:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:38:08,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258083384] [2025-03-17 05:38:08,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:08,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:38:08,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 05:38:08,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 05:38:08,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:08,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:38:08,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:38:08,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258083384] [2025-03-17 05:38:08,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258083384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:08,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:08,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:38:08,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171708463] [2025-03-17 05:38:08,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:08,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:38:08,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:38:08,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:38:08,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:38:08,169 INFO L87 Difference]: Start difference. First operand 343 states and 397 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:08,417 INFO L93 Difference]: Finished difference Result 657 states and 763 transitions. [2025-03-17 05:38:08,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:38:08,419 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2025-03-17 05:38:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:08,420 INFO L225 Difference]: With dead ends: 657 [2025-03-17 05:38:08,420 INFO L226 Difference]: Without dead ends: 343 [2025-03-17 05:38:08,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:38:08,421 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 49 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:08,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 197 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:38:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-17 05:38:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2025-03-17 05:38:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 295 states have (on average 1.1457627118644067) internal successors, (338), 297 states have internal predecessors, (338), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:38:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 394 transitions. [2025-03-17 05:38:08,457 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 394 transitions. Word has length 79 [2025-03-17 05:38:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:08,457 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 394 transitions. [2025-03-17 05:38:08,457 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 394 transitions. [2025-03-17 05:38:08,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 05:38:08,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:08,459 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:38:08,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:38:08,459 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:08,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:08,460 INFO L85 PathProgramCache]: Analyzing trace with hash 655005951, now seen corresponding path program 1 times [2025-03-17 05:38:08,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:38:08,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233128456] [2025-03-17 05:38:08,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:08,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:38:08,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 05:38:08,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 05:38:08,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:08,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:38:08,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:38:08,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233128456] [2025-03-17 05:38:08,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233128456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:08,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:08,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:38:08,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456924185] [2025-03-17 05:38:08,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:08,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:38:08,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:38:08,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:38:08,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:38:08,536 INFO L87 Difference]: Start difference. First operand 343 states and 394 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:08,729 INFO L93 Difference]: Finished difference Result 769 states and 886 transitions. [2025-03-17 05:38:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:38:08,730 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2025-03-17 05:38:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:08,731 INFO L225 Difference]: With dead ends: 769 [2025-03-17 05:38:08,732 INFO L226 Difference]: Without dead ends: 455 [2025-03-17 05:38:08,732 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-17 05:38:08,732 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 44 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:08,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 402 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:38:08,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-03-17 05:38:08,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 377. [2025-03-17 05:38:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 329 states have (on average 1.1398176291793314) internal successors, (375), 331 states have internal predecessors, (375), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:38:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 431 transitions. [2025-03-17 05:38:08,769 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 431 transitions. Word has length 79 [2025-03-17 05:38:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:08,769 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 431 transitions. [2025-03-17 05:38:08,770 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 431 transitions. [2025-03-17 05:38:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 05:38:08,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:08,770 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:38:08,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:38:08,770 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:08,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:08,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2081410521, now seen corresponding path program 1 times [2025-03-17 05:38:08,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:38:08,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696566411] [2025-03-17 05:38:08,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:08,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:38:08,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 05:38:08,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 05:38:08,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:08,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:38:09,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:38:09,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696566411] [2025-03-17 05:38:09,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696566411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:09,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:09,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:38:09,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054426322] [2025-03-17 05:38:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:09,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:38:09,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:38:09,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:38:09,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:38:09,255 INFO L87 Difference]: Start difference. First operand 377 states and 431 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 05:38:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:09,680 INFO L93 Difference]: Finished difference Result 926 states and 1061 transitions. [2025-03-17 05:38:09,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:38:09,681 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2025-03-17 05:38:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:09,683 INFO L225 Difference]: With dead ends: 926 [2025-03-17 05:38:09,683 INFO L226 Difference]: Without dead ends: 578 [2025-03-17 05:38:09,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:38:09,684 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 312 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:09,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 248 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:38:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-17 05:38:09,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 525. [2025-03-17 05:38:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 477 states have (on average 1.1467505241090146) internal successors, (547), 479 states have internal predecessors, (547), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:38:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 603 transitions. [2025-03-17 05:38:09,723 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 603 transitions. Word has length 81 [2025-03-17 05:38:09,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:09,723 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 603 transitions. [2025-03-17 05:38:09,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 05:38:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 603 transitions. [2025-03-17 05:38:09,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 05:38:09,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:09,724 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:38:09,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:38:09,725 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:09,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:09,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1336414766, now seen corresponding path program 1 times [2025-03-17 05:38:09,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:38:09,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958023054] [2025-03-17 05:38:09,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:09,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:38:09,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 05:38:09,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 05:38:09,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:09,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:38:09,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:38:09,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958023054] [2025-03-17 05:38:09,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958023054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:09,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:09,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:38:09,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032698571] [2025-03-17 05:38:09,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:09,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:38:09,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:38:09,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:38:09,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:38:09,819 INFO L87 Difference]: Start difference. First operand 525 states and 603 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:09,942 INFO L93 Difference]: Finished difference Result 1161 states and 1337 transitions. [2025-03-17 05:38:09,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:38:09,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2025-03-17 05:38:09,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:09,945 INFO L225 Difference]: With dead ends: 1161 [2025-03-17 05:38:09,945 INFO L226 Difference]: Without dead ends: 665 [2025-03-17 05:38:09,946 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-17 05:38:09,946 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 31 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:09,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 316 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:38:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-17 05:38:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 555. [2025-03-17 05:38:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 507 states have (on average 1.1380670611439843) internal successors, (577), 509 states have internal predecessors, (577), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:38:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 633 transitions. [2025-03-17 05:38:09,989 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 633 transitions. Word has length 82 [2025-03-17 05:38:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:09,990 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 633 transitions. [2025-03-17 05:38:09,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:09,991 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 633 transitions. [2025-03-17 05:38:09,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 05:38:09,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:09,992 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:38:09,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:38:09,992 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:09,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash -321641198, now seen corresponding path program 1 times [2025-03-17 05:38:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:38:09,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687403499] [2025-03-17 05:38:09,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:09,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:38:10,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 05:38:10,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 05:38:10,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:10,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:38:10,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:38:10,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687403499] [2025-03-17 05:38:10,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687403499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:10,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:10,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:38:10,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185979886] [2025-03-17 05:38:10,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:10,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:38:10,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:38:10,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:38:10,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:38:10,142 INFO L87 Difference]: Start difference. First operand 555 states and 633 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:10,273 INFO L93 Difference]: Finished difference Result 1157 states and 1319 transitions. [2025-03-17 05:38:10,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:38:10,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2025-03-17 05:38:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:10,275 INFO L225 Difference]: With dead ends: 1157 [2025-03-17 05:38:10,275 INFO L226 Difference]: Without dead ends: 631 [2025-03-17 05:38:10,276 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-17 05:38:10,276 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 34 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:10,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 395 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:38:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-17 05:38:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 473. [2025-03-17 05:38:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 425 states have (on average 1.1223529411764706) internal successors, (477), 427 states have internal predecessors, (477), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:38:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 533 transitions. [2025-03-17 05:38:10,320 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 533 transitions. Word has length 82 [2025-03-17 05:38:10,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:10,320 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 533 transitions. [2025-03-17 05:38:10,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 533 transitions. [2025-03-17 05:38:10,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 05:38:10,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:10,321 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:38:10,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:38:10,321 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:10,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:10,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2058863732, now seen corresponding path program 1 times [2025-03-17 05:38:10,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:38:10,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748392792] [2025-03-17 05:38:10,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:10,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:38:10,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 05:38:10,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 05:38:10,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:10,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:38:11,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:38:11,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748392792] [2025-03-17 05:38:11,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748392792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:11,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:11,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:38:11,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031246119] [2025-03-17 05:38:11,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:11,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:38:11,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:38:11,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:38:11,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:38:11,296 INFO L87 Difference]: Start difference. First operand 473 states and 533 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 05:38:12,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:12,256 INFO L93 Difference]: Finished difference Result 931 states and 1051 transitions. [2025-03-17 05:38:12,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:38:12,256 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2025-03-17 05:38:12,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:12,259 INFO L225 Difference]: With dead ends: 931 [2025-03-17 05:38:12,259 INFO L226 Difference]: Without dead ends: 487 [2025-03-17 05:38:12,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:38:12,260 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 446 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:12,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 473 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:38:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-03-17 05:38:12,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 476. [2025-03-17 05:38:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 428 states have (on average 1.1214953271028036) internal successors, (480), 430 states have internal predecessors, (480), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:38:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 536 transitions. [2025-03-17 05:38:12,316 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 536 transitions. Word has length 84 [2025-03-17 05:38:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:12,316 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 536 transitions. [2025-03-17 05:38:12,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 05:38:12,317 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 536 transitions. [2025-03-17 05:38:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 05:38:12,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:12,317 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:38:12,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:38:12,318 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:12,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash -791677681, now seen corresponding path program 1 times [2025-03-17 05:38:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:38:12,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670330184] [2025-03-17 05:38:12,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:12,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:38:12,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 05:38:12,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 05:38:12,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:12,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:12,484 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:38:12,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:38:12,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670330184] [2025-03-17 05:38:12,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670330184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:12,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:12,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:38:12,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222440579] [2025-03-17 05:38:12,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:12,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:38:12,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:38:12,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:38:12,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:38:12,486 INFO L87 Difference]: Start difference. First operand 476 states and 536 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:12,719 INFO L93 Difference]: Finished difference Result 900 states and 1011 transitions. [2025-03-17 05:38:12,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:38:12,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 86 [2025-03-17 05:38:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:12,721 INFO L225 Difference]: With dead ends: 900 [2025-03-17 05:38:12,721 INFO L226 Difference]: Without dead ends: 453 [2025-03-17 05:38:12,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:38:12,722 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:12,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:38:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-17 05:38:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2025-03-17 05:38:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 405 states have (on average 1.1037037037037036) internal successors, (447), 407 states have internal predecessors, (447), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:38:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 503 transitions. [2025-03-17 05:38:12,764 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 503 transitions. Word has length 86 [2025-03-17 05:38:12,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:12,764 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 503 transitions. [2025-03-17 05:38:12,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 503 transitions. [2025-03-17 05:38:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:38:12,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:12,765 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:38:12,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 05:38:12,765 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:12,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:12,766 INFO L85 PathProgramCache]: Analyzing trace with hash -334722527, now seen corresponding path program 1 times [2025-03-17 05:38:12,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:38:12,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591437242] [2025-03-17 05:38:12,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:12,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:38:12,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:38:12,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:38:12,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:12,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2025-03-17 05:38:14,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:38:14,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591437242] [2025-03-17 05:38:14,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591437242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:38:14,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004107401] [2025-03-17 05:38:14,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:14,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:38:14,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:38:14,769 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-17 05:38:14,770 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-17 05:38:14,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:38:14,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:38:14,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:14,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:14,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 05:38:14,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:38:17,414 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-17 05:38:18,036 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-17 05:38:18,148 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 65 treesize of output 41 [2025-03-17 05:38:18,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:38:18,486 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 64 treesize of output 32 [2025-03-17 05:38:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 9 proven. 272 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-03-17 05:38:18,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:38:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2025-03-17 05:38:19,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004107401] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:38:19,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:38:19,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17, 13] total 30 [2025-03-17 05:38:19,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544261627] [2025-03-17 05:38:19,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:19,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:38:19,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:38:19,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:38:19,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2025-03-17 05:38:19,207 INFO L87 Difference]: Start difference. First operand 453 states and 503 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:19,868 INFO L93 Difference]: Finished difference Result 824 states and 907 transitions. [2025-03-17 05:38:19,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:38:19,869 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 156 [2025-03-17 05:38:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:19,870 INFO L225 Difference]: With dead ends: 824 [2025-03-17 05:38:19,870 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 05:38:19,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=113, Invalid=1077, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 05:38:19,872 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 38 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:19,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 703 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:38:19,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 05:38:19,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 05:38:19,872 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-17 05:38:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 05:38:19,873 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2025-03-17 05:38:19,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:19,873 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 05:38:19,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:38:19,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 05:38:19,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 05:38:19,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:38:19,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 05:38:20,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:38:20,084 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] [2025-03-17 05:38:20,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 05:38:26,289 WARN L286 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 209 DAG size of output: 189 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)