./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.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 d3f6bd0cc41c3fb11f5cfcc3010a6654288179c0475495df5b9f3093567937e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:08:48,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:08:48,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:08:48,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:08:48,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:08:48,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:08:48,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:08:48,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:08:48,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:08:48,676 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:08:48,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:08:48,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:08:48,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:08:48,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:08:48,677 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:08:48,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:08:48,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:08:48,677 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:08:48,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:08:48,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:08:48,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:08:48,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:08:48,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:08:48,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:08:48,678 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:08:48,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:08:48,678 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:08:48,678 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:08:48,678 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:08:48,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:08:48,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:08:48,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:08:48,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:08:48,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:08:48,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:08:48,679 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:08:48,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:08:48,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:08:48,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:08:48,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:08:48,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:08:48,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:08:48,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:08:48,680 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 -> d3f6bd0cc41c3fb11f5cfcc3010a6654288179c0475495df5b9f3093567937e2 [2025-03-04 01:08:48,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:08:48,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:08:48,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:08:48,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:08:48,930 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:08:48,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i [2025-03-04 01:08:50,103 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f347e3305/2364a24e96174853b9950a38fbd013d1/FLAG39897880a [2025-03-04 01:08:50,342 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:08:50,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i [2025-03-04 01:08:50,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f347e3305/2364a24e96174853b9950a38fbd013d1/FLAG39897880a [2025-03-04 01:08:50,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f347e3305/2364a24e96174853b9950a38fbd013d1 [2025-03-04 01:08:50,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:08:50,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:08:50,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:08:50,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:08:50,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:08:50,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:08:50" (1/1) ... [2025-03-04 01:08:50,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37821d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50, skipping insertion in model container [2025-03-04 01:08:50,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:08:50" (1/1) ... [2025-03-04 01:08:50,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:08:50,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i[916,929] [2025-03-04 01:08:50,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:08:50,871 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:08:50,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i[916,929] [2025-03-04 01:08:50,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:08:50,939 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:08:50,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50 WrapperNode [2025-03-04 01:08:50,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:08:50,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:08:50,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:08:50,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:08:50,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50" (1/1) ... [2025-03-04 01:08:50,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50" (1/1) ... [2025-03-04 01:08:50,995 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 431 [2025-03-04 01:08:51,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:08:51,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:08:51,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:08:51,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:08:51,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50" (1/1) ... [2025-03-04 01:08:51,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50" (1/1) ... [2025-03-04 01:08:51,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50" (1/1) ... [2025-03-04 01:08:51,037 INFO L175 MemorySlicer]: Split 123 memory accesses to 6 slices as follows [2, 8, 8, 73, 7, 25]. 59 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 6, 1, 3]. The 16 writes are split as follows [0, 1, 3, 7, 1, 4]. [2025-03-04 01:08:51,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50" (1/1) ... [2025-03-04 01:08:51,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50" (1/1) ... [2025-03-04 01:08:51,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50" (1/1) ... [2025-03-04 01:08:51,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50" (1/1) ... [2025-03-04 01:08:51,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50" (1/1) ... [2025-03-04 01:08:51,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50" (1/1) ... [2025-03-04 01:08:51,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:08:51,071 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:08:51,072 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:08:51,072 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:08:51,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50" (1/1) ... [2025-03-04 01:08:51,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:08:51,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:08:51,097 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-04 01:08:51,099 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-04 01:08:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:08:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:08:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:08:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:08:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:08:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:08:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:08:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:08:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:08:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:08:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:08:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:08:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:08:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:08:51,119 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:08:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:08:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:08:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:08:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:08:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:08:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:08:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:08:51,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:08:51,207 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:08:51,209 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:08:51,546 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~ite76#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~mem75#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short79#1;havoc property_#t~ite100#1;havoc property_#t~mem80#1;havoc property_#t~ite99#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem98#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short108#1;havoc property_#t~ite113#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1; [2025-03-04 01:08:51,578 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-04 01:08:51,578 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:08:51,590 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:08:51,590 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:08:51,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:08:51 BoogieIcfgContainer [2025-03-04 01:08:51,591 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:08:51,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:08:51,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:08:51,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:08:51,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:08:50" (1/3) ... [2025-03-04 01:08:51,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5210ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:08:51, skipping insertion in model container [2025-03-04 01:08:51,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:08:50" (2/3) ... [2025-03-04 01:08:51,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5210ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:08:51, skipping insertion in model container [2025-03-04 01:08:51,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:08:51" (3/3) ... [2025-03-04 01:08:51,599 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-66.i [2025-03-04 01:08:51,610 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:08:51,612 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-66.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:08:51,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:08:51,656 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;@5de2feff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:08:51,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:08:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:08:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:08:51,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:51,666 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:08:51,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:51,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:51,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1469854672, now seen corresponding path program 1 times [2025-03-04 01:08:51,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:51,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837828687] [2025-03-04 01:08:51,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:51,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:51,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:08:51,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:08:51,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:51,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:08:51,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:51,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837828687] [2025-03-04 01:08:51,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837828687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:08:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067235503] [2025-03-04 01:08:51,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:51,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:08:51,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:08:51,919 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-04 01:08:51,921 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-04 01:08:52,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:08:52,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:08:52,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:52,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:52,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:08:52,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:08:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:08:52,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:08:52,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067235503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:52,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:08:52,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:08:52,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230085755] [2025-03-04 01:08:52,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:52,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:08:52,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:52,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:08:52,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:08:52,145 INFO L87 Difference]: Start difference. First operand has 85 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:08:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:52,167 INFO L93 Difference]: Finished difference Result 164 states and 255 transitions. [2025-03-04 01:08:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:08:52,169 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2025-03-04 01:08:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:52,174 INFO L225 Difference]: With dead ends: 164 [2025-03-04 01:08:52,174 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 01:08:52,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-04 01:08:52,179 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:52,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:08:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 01:08:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-04 01:08:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:08:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2025-03-04 01:08:52,215 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 109 [2025-03-04 01:08:52,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:52,216 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2025-03-04 01:08:52,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:08:52,216 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2025-03-04 01:08:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:08:52,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:52,219 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:08:52,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:08:52,419 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-04 01:08:52,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:52,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:52,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1478786114, now seen corresponding path program 1 times [2025-03-04 01:08:52,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:52,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998986218] [2025-03-04 01:08:52,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:52,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:52,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:08:52,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:08:52,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:52,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:08:52,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:52,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998986218] [2025-03-04 01:08:52,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998986218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:52,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:52,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:08:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137677279] [2025-03-04 01:08:52,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:52,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:08:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:52,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:08:52,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:08:52,715 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:08:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:52,752 INFO L93 Difference]: Finished difference Result 164 states and 237 transitions. [2025-03-04 01:08:52,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:08:52,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-04 01:08:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:52,757 INFO L225 Difference]: With dead ends: 164 [2025-03-04 01:08:52,757 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 01:08:52,757 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-04 01:08:52,758 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 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-04 01:08:52,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:08:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 01:08:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-03-04 01:08:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:08:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-03-04 01:08:52,765 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 109 [2025-03-04 01:08:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:52,767 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-03-04 01:08:52,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:08:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-03-04 01:08:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:08:52,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:52,769 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:08:52,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:08:52,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:52,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1928677501, now seen corresponding path program 1 times [2025-03-04 01:08:52,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:52,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603007466] [2025-03-04 01:08:52,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:52,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:52,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:08:52,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:08:52,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:52,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:08:52,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:52,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603007466] [2025-03-04 01:08:52,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603007466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:52,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:52,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:08:52,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005046932] [2025-03-04 01:08:52,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:52,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:08:52,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:52,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:08:52,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:08:52,948 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:08:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:52,972 INFO L93 Difference]: Finished difference Result 168 states and 241 transitions. [2025-03-04 01:08:52,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:08:52,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-04 01:08:52,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:52,974 INFO L225 Difference]: With dead ends: 168 [2025-03-04 01:08:52,974 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 01:08:52,974 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-04 01:08:52,975 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 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-04 01:08:52,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:08:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 01:08:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-03-04 01:08:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:08:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2025-03-04 01:08:52,981 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 109 [2025-03-04 01:08:52,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:52,981 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2025-03-04 01:08:52,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:08:52,982 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2025-03-04 01:08:52,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:08:52,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:52,983 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:08:52,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:08:52,983 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:52,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:52,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1927753980, now seen corresponding path program 1 times [2025-03-04 01:08:52,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:52,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749788237] [2025-03-04 01:08:52,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:52,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:52,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:08:53,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:08:53,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:53,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:08:53,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:53,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749788237] [2025-03-04 01:08:53,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749788237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:53,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:53,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:08:53,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516520520] [2025-03-04 01:08:53,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:53,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:08:53,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:53,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:08:53,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:08:53,746 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:08:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:53,965 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2025-03-04 01:08:53,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:08:53,966 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-04 01:08:53,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:53,969 INFO L225 Difference]: With dead ends: 252 [2025-03-04 01:08:53,969 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 01:08:53,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:08:53,972 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 78 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:53,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 367 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:08:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 01:08:53,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2025-03-04 01:08:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.323076923076923) internal successors, (172), 130 states have internal predecessors, (172), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:08:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 228 transitions. [2025-03-04 01:08:53,994 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 228 transitions. Word has length 109 [2025-03-04 01:08:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:53,995 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 228 transitions. [2025-03-04 01:08:53,995 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:08:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 228 transitions. [2025-03-04 01:08:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:08:54,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:54,000 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:08:54,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:08:54,000 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:54,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:54,001 INFO L85 PathProgramCache]: Analyzing trace with hash -911179747, now seen corresponding path program 1 times [2025-03-04 01:08:54,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:54,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999040083] [2025-03-04 01:08:54,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:54,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:54,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:08:54,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:08:54,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:54,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:08:54,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:54,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999040083] [2025-03-04 01:08:54,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999040083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:54,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:54,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:08:54,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300859132] [2025-03-04 01:08:54,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:54,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:08:54,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:54,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:08:54,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:08:54,392 INFO L87 Difference]: Start difference. First operand 161 states and 228 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:08:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:54,667 INFO L93 Difference]: Finished difference Result 338 states and 471 transitions. [2025-03-04 01:08:54,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:08:54,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2025-03-04 01:08:54,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:54,670 INFO L225 Difference]: With dead ends: 338 [2025-03-04 01:08:54,672 INFO L226 Difference]: Without dead ends: 255 [2025-03-04 01:08:54,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:08:54,674 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 222 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:54,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 383 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:08:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-04 01:08:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 176. [2025-03-04 01:08:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 141 states have (on average 1.297872340425532) internal successors, (183), 142 states have internal predecessors, (183), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:08:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 243 transitions. [2025-03-04 01:08:54,696 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 243 transitions. Word has length 110 [2025-03-04 01:08:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:54,696 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 243 transitions. [2025-03-04 01:08:54,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:08:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 243 transitions. [2025-03-04 01:08:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:08:54,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:54,697 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:08:54,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:08:54,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:54,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2030477852, now seen corresponding path program 1 times [2025-03-04 01:08:54,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:54,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43204091] [2025-03-04 01:08:54,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:54,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:08:54,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:08:54,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:54,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:08:56,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:56,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43204091] [2025-03-04 01:08:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43204091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:56,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:56,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:08:56,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142708843] [2025-03-04 01:08:56,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:56,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:08:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:56,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:08:56,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:08:56,794 INFO L87 Difference]: Start difference. First operand 176 states and 243 transitions. Second operand has 12 states, 10 states have (on average 4.3) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:08:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:08:57,997 INFO L93 Difference]: Finished difference Result 350 states and 481 transitions. [2025-03-04 01:08:57,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:08:57,997 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.3) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 110 [2025-03-04 01:08:57,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:08:57,999 INFO L225 Difference]: With dead ends: 350 [2025-03-04 01:08:57,999 INFO L226 Difference]: Without dead ends: 261 [2025-03-04 01:08:57,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:08:58,000 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 274 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:08:58,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 879 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:08:58,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-04 01:08:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 256. [2025-03-04 01:08:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 204 states have (on average 1.2941176470588236) internal successors, (264), 206 states have internal predecessors, (264), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:08:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 352 transitions. [2025-03-04 01:08:58,031 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 352 transitions. Word has length 110 [2025-03-04 01:08:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:08:58,031 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 352 transitions. [2025-03-04 01:08:58,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.3) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:08:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 352 transitions. [2025-03-04 01:08:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:08:58,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:08:58,033 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:08:58,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:08:58,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:08:58,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:08:58,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1737074845, now seen corresponding path program 1 times [2025-03-04 01:08:58,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:08:58,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913687311] [2025-03-04 01:08:58,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:08:58,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:08:58,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:08:58,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:08:58,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:08:58,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:08:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:08:58,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:08:58,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913687311] [2025-03-04 01:08:58,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913687311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:58,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:58,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:08:58,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416303381] [2025-03-04 01:08:58,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:58,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:08:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:08:58,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:08:58,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:08:58,980 INFO L87 Difference]: Start difference. First operand 256 states and 352 transitions. Second operand has 12 states, 9 states have (on average 4.777777777777778) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 01:09:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:00,458 INFO L93 Difference]: Finished difference Result 651 states and 885 transitions. [2025-03-04 01:09:00,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 01:09:00,459 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 4.777777777777778) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 110 [2025-03-04 01:09:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:00,462 INFO L225 Difference]: With dead ends: 651 [2025-03-04 01:09:00,462 INFO L226 Difference]: Without dead ends: 482 [2025-03-04 01:09:00,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:09:00,464 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 515 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:00,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 729 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:09:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-04 01:09:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 398. [2025-03-04 01:09:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 318 states have (on average 1.2861635220125787) internal successors, (409), 322 states have internal predecessors, (409), 66 states have call successors, (66), 13 states have call predecessors, (66), 13 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:09:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 541 transitions. [2025-03-04 01:09:00,502 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 541 transitions. Word has length 110 [2025-03-04 01:09:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:00,502 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 541 transitions. [2025-03-04 01:09:00,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 4.777777777777778) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 01:09:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 541 transitions. [2025-03-04 01:09:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:09:00,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:00,504 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:00,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:09:00,504 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:00,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:00,504 INFO L85 PathProgramCache]: Analyzing trace with hash 958091942, now seen corresponding path program 1 times [2025-03-04 01:09:00,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:00,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106672149] [2025-03-04 01:09:00,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:00,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:00,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:09:00,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:09:00,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:00,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:01,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:01,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106672149] [2025-03-04 01:09:01,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106672149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:01,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:01,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:09:01,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081154882] [2025-03-04 01:09:01,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:01,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:09:01,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:01,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:09:01,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:09:01,478 INFO L87 Difference]: Start difference. First operand 398 states and 541 transitions. Second operand has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:09:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:02,119 INFO L93 Difference]: Finished difference Result 836 states and 1133 transitions. [2025-03-04 01:09:02,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:09:02,120 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 111 [2025-03-04 01:09:02,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:02,122 INFO L225 Difference]: With dead ends: 836 [2025-03-04 01:09:02,123 INFO L226 Difference]: Without dead ends: 446 [2025-03-04 01:09:02,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:09:02,124 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 207 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:02,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 677 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:09:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-04 01:09:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 436. [2025-03-04 01:09:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 341 states have (on average 1.2668621700879765) internal successors, (432), 345 states have internal predecessors, (432), 78 states have call successors, (78), 16 states have call predecessors, (78), 16 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 01:09:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 588 transitions. [2025-03-04 01:09:02,168 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 588 transitions. Word has length 111 [2025-03-04 01:09:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:02,168 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 588 transitions. [2025-03-04 01:09:02,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:09:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 588 transitions. [2025-03-04 01:09:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:09:02,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:02,170 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:02,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:09:02,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:02,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:02,171 INFO L85 PathProgramCache]: Analyzing trace with hash 664688935, now seen corresponding path program 1 times [2025-03-04 01:09:02,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:02,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72767648] [2025-03-04 01:09:02,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:02,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:02,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:09:02,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:09:02,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:02,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:02,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72767648] [2025-03-04 01:09:02,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72767648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:02,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:02,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:09:02,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007844627] [2025-03-04 01:09:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:02,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:09:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:02,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:09:02,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:09:02,421 INFO L87 Difference]: Start difference. First operand 436 states and 588 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:02,560 INFO L93 Difference]: Finished difference Result 838 states and 1132 transitions. [2025-03-04 01:09:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:09:02,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-04 01:09:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:02,565 INFO L225 Difference]: With dead ends: 838 [2025-03-04 01:09:02,565 INFO L226 Difference]: Without dead ends: 442 [2025-03-04 01:09:02,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:09:02,569 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 71 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:02,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 313 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:09:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-04 01:09:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 434. [2025-03-04 01:09:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 339 states have (on average 1.2625368731563422) internal successors, (428), 343 states have internal predecessors, (428), 78 states have call successors, (78), 16 states have call predecessors, (78), 16 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 01:09:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 584 transitions. [2025-03-04 01:09:02,626 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 584 transitions. Word has length 111 [2025-03-04 01:09:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:02,627 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 584 transitions. [2025-03-04 01:09:02,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 584 transitions. [2025-03-04 01:09:02,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:09:02,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:02,628 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:02,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:09:02,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:02,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:02,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1660016640, now seen corresponding path program 1 times [2025-03-04 01:09:02,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:02,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406877774] [2025-03-04 01:09:02,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:02,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:02,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:09:02,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:09:02,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:02,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:03,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:03,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406877774] [2025-03-04 01:09:03,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406877774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:03,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:03,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:09:03,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906967077] [2025-03-04 01:09:03,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:03,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:09:03,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:03,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:09:03,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:03,151 INFO L87 Difference]: Start difference. First operand 434 states and 584 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:03,616 INFO L93 Difference]: Finished difference Result 811 states and 1097 transitions. [2025-03-04 01:09:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:09:03,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2025-03-04 01:09:03,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:03,619 INFO L225 Difference]: With dead ends: 811 [2025-03-04 01:09:03,619 INFO L226 Difference]: Without dead ends: 504 [2025-03-04 01:09:03,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:09:03,620 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 282 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:03,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 328 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:09:03,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-04 01:09:03,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 432. [2025-03-04 01:09:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 337 states have (on average 1.2551928783382789) internal successors, (423), 341 states have internal predecessors, (423), 78 states have call successors, (78), 16 states have call predecessors, (78), 16 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 01:09:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 579 transitions. [2025-03-04 01:09:03,674 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 579 transitions. Word has length 112 [2025-03-04 01:09:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:03,675 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 579 transitions. [2025-03-04 01:09:03,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 579 transitions. [2025-03-04 01:09:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:09:03,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:03,677 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:03,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:09:03,677 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:03,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash 510456538, now seen corresponding path program 1 times [2025-03-04 01:09:03,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:03,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210495565] [2025-03-04 01:09:03,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:03,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:03,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:09:03,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:09:03,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:03,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:09:03,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:03,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210495565] [2025-03-04 01:09:03,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210495565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:09:03,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696450706] [2025-03-04 01:09:03,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:03,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:03,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:09:03,786 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-04 01:09:03,788 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-04 01:09:03,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:09:03,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:09:03,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:03,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:03,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:09:03,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:09:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:03,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:09:03,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696450706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:03,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:09:03,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:09:03,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939078483] [2025-03-04 01:09:03,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:03,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:09:03,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:03,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:09:03,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:03,938 INFO L87 Difference]: Start difference. First operand 432 states and 579 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:03,999 INFO L93 Difference]: Finished difference Result 839 states and 1126 transitions. [2025-03-04 01:09:03,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:09:04,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-04 01:09:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:04,002 INFO L225 Difference]: With dead ends: 839 [2025-03-04 01:09:04,002 INFO L226 Difference]: Without dead ends: 447 [2025-03-04 01:09:04,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 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-04 01:09:04,003 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 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-04 01:09:04,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-04 01:09:04,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2025-03-04 01:09:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 352 states have (on average 1.2443181818181819) internal successors, (438), 356 states have internal predecessors, (438), 78 states have call successors, (78), 16 states have call predecessors, (78), 16 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 01:09:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 594 transitions. [2025-03-04 01:09:04,053 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 594 transitions. Word has length 113 [2025-03-04 01:09:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:04,053 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 594 transitions. [2025-03-04 01:09:04,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 594 transitions. [2025-03-04 01:09:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:09:04,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:04,055 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:04,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:09:04,255 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,SelfDestructingSolverStorable10 [2025-03-04 01:09:04,256 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:04,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:04,256 INFO L85 PathProgramCache]: Analyzing trace with hash -124147616, now seen corresponding path program 1 times [2025-03-04 01:09:04,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:04,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724954364] [2025-03-04 01:09:04,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:04,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:04,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:09:04,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:09:04,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:04,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:04,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:04,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724954364] [2025-03-04 01:09:04,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724954364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:04,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:04,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:09:04,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449747392] [2025-03-04 01:09:04,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:04,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:09:04,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:04,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:09:04,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:09:04,613 INFO L87 Difference]: Start difference. First operand 447 states and 594 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:05,288 INFO L93 Difference]: Finished difference Result 999 states and 1337 transitions. [2025-03-04 01:09:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:09:05,289 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-04 01:09:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:05,293 INFO L225 Difference]: With dead ends: 999 [2025-03-04 01:09:05,293 INFO L226 Difference]: Without dead ends: 682 [2025-03-04 01:09:05,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:09:05,294 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 313 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:05,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 643 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:09:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-04 01:09:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 459. [2025-03-04 01:09:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 364 states have (on average 1.2527472527472527) internal successors, (456), 368 states have internal predecessors, (456), 78 states have call successors, (78), 16 states have call predecessors, (78), 16 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 01:09:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 612 transitions. [2025-03-04 01:09:05,342 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 612 transitions. Word has length 113 [2025-03-04 01:09:05,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:05,342 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 612 transitions. [2025-03-04 01:09:05,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:05,343 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 612 transitions. [2025-03-04 01:09:05,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:09:05,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:05,344 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:05,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:09:05,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:05,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:05,344 INFO L85 PathProgramCache]: Analyzing trace with hash -417550623, now seen corresponding path program 1 times [2025-03-04 01:09:05,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:05,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081954539] [2025-03-04 01:09:05,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:05,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:05,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:09:05,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:09:05,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:05,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:05,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:05,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081954539] [2025-03-04 01:09:05,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081954539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:05,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:05,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:09:05,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782164343] [2025-03-04 01:09:05,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:05,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:09:05,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:05,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:09:05,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:09:05,703 INFO L87 Difference]: Start difference. First operand 459 states and 612 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:05,888 INFO L93 Difference]: Finished difference Result 856 states and 1146 transitions. [2025-03-04 01:09:05,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:09:05,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2025-03-04 01:09:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:05,891 INFO L225 Difference]: With dead ends: 856 [2025-03-04 01:09:05,892 INFO L226 Difference]: Without dead ends: 527 [2025-03-04 01:09:05,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:05,894 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 85 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:05,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 809 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:09:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-04 01:09:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 461. [2025-03-04 01:09:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 366 states have (on average 1.2513661202185793) internal successors, (458), 370 states have internal predecessors, (458), 78 states have call successors, (78), 16 states have call predecessors, (78), 16 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 01:09:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 614 transitions. [2025-03-04 01:09:05,945 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 614 transitions. Word has length 113 [2025-03-04 01:09:05,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:05,945 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 614 transitions. [2025-03-04 01:09:05,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 614 transitions. [2025-03-04 01:09:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:09:05,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:05,947 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:05,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:09:05,947 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:05,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:05,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1477457313, now seen corresponding path program 1 times [2025-03-04 01:09:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:05,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671425178] [2025-03-04 01:09:05,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:05,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:05,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:09:06,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:09:06,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:06,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:08,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:08,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671425178] [2025-03-04 01:09:08,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671425178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:08,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:08,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-04 01:09:08,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077593415] [2025-03-04 01:09:08,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:08,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 01:09:08,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:08,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 01:09:08,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:09:08,438 INFO L87 Difference]: Start difference. First operand 461 states and 614 transitions. Second operand has 21 states, 16 states have (on average 2.875) internal successors, (46), 21 states have internal predecessors, (46), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 01:09:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:12,800 INFO L93 Difference]: Finished difference Result 1222 states and 1638 transitions. [2025-03-04 01:09:12,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 01:09:12,801 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 2.875) internal successors, (46), 21 states have internal predecessors, (46), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 6 states have call successors, (14) Word has length 113 [2025-03-04 01:09:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:12,805 INFO L225 Difference]: With dead ends: 1222 [2025-03-04 01:09:12,805 INFO L226 Difference]: Without dead ends: 891 [2025-03-04 01:09:12,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=244, Invalid=1826, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 01:09:12,807 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 442 mSDsluCounter, 2484 mSDsCounter, 0 mSdLazyCounter, 3097 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 3242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 3097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:12,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 2717 Invalid, 3242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 3097 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-04 01:09:12,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-03-04 01:09:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 694. [2025-03-04 01:09:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 553 states have (on average 1.2549728752260398) internal successors, (694), 560 states have internal predecessors, (694), 116 states have call successors, (116), 24 states have call predecessors, (116), 24 states have return successors, (116), 109 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-04 01:09:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 926 transitions. [2025-03-04 01:09:12,877 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 926 transitions. Word has length 113 [2025-03-04 01:09:12,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:12,878 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 926 transitions. [2025-03-04 01:09:12,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 2.875) internal successors, (46), 21 states have internal predecessors, (46), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 01:09:12,878 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 926 transitions. [2025-03-04 01:09:12,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:09:12,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:12,879 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:12,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:09:12,880 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:12,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:12,880 INFO L85 PathProgramCache]: Analyzing trace with hash 87203297, now seen corresponding path program 1 times [2025-03-04 01:09:12,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:12,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17049773] [2025-03-04 01:09:12,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:12,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:12,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:09:12,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:09:12,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:12,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:13,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:13,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17049773] [2025-03-04 01:09:13,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17049773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:13,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:13,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:09:13,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678052392] [2025-03-04 01:09:13,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:13,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:09:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:13,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:09:13,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:09:13,342 INFO L87 Difference]: Start difference. First operand 694 states and 926 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:13,976 INFO L93 Difference]: Finished difference Result 1110 states and 1481 transitions. [2025-03-04 01:09:13,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:09:13,976 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2025-03-04 01:09:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:13,980 INFO L225 Difference]: With dead ends: 1110 [2025-03-04 01:09:13,980 INFO L226 Difference]: Without dead ends: 779 [2025-03-04 01:09:13,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:09:13,981 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 247 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:13,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 679 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:09:13,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-03-04 01:09:14,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 528. [2025-03-04 01:09:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 416 states have (on average 1.2451923076923077) internal successors, (518), 421 states have internal predecessors, (518), 92 states have call successors, (92), 19 states have call predecessors, (92), 19 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-04 01:09:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 702 transitions. [2025-03-04 01:09:14,046 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 702 transitions. Word has length 113 [2025-03-04 01:09:14,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:14,046 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 702 transitions. [2025-03-04 01:09:14,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 702 transitions. [2025-03-04 01:09:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:09:14,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:14,048 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:14,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:09:14,048 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:14,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:14,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1266106400, now seen corresponding path program 1 times [2025-03-04 01:09:14,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:14,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692528837] [2025-03-04 01:09:14,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:14,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:14,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:09:14,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:09:14,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:14,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:14,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:14,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692528837] [2025-03-04 01:09:14,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692528837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:14,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:14,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:09:14,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452078558] [2025-03-04 01:09:14,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:14,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:09:14,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:14,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:09:14,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:09:14,851 INFO L87 Difference]: Start difference. First operand 528 states and 702 transitions. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 14 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:09:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:15,994 INFO L93 Difference]: Finished difference Result 1485 states and 1986 transitions. [2025-03-04 01:09:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 01:09:15,994 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 14 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2025-03-04 01:09:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:15,999 INFO L225 Difference]: With dead ends: 1485 [2025-03-04 01:09:15,999 INFO L226 Difference]: Without dead ends: 1093 [2025-03-04 01:09:16,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:09:16,001 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 602 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:16,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1466 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1361 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:09:16,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2025-03-04 01:09:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 628. [2025-03-04 01:09:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 499 states have (on average 1.250501002004008) internal successors, (624), 504 states have internal predecessors, (624), 106 states have call successors, (106), 22 states have call predecessors, (106), 22 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-04 01:09:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 836 transitions. [2025-03-04 01:09:16,074 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 836 transitions. Word has length 113 [2025-03-04 01:09:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:16,075 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 836 transitions. [2025-03-04 01:09:16,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 14 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:09:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 836 transitions. [2025-03-04 01:09:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:09:16,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:16,077 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:16,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:09:16,077 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:16,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:16,077 INFO L85 PathProgramCache]: Analyzing trace with hash 623297436, now seen corresponding path program 1 times [2025-03-04 01:09:16,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:16,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438902075] [2025-03-04 01:09:16,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:16,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:16,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:09:16,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:09:16,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:16,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:16,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:16,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438902075] [2025-03-04 01:09:16,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438902075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:16,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:16,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:09:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464698100] [2025-03-04 01:09:16,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:16,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:09:16,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:16,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:09:16,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:09:16,439 INFO L87 Difference]: Start difference. First operand 628 states and 836 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:16,988 INFO L93 Difference]: Finished difference Result 1548 states and 2079 transitions. [2025-03-04 01:09:16,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:09:16,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2025-03-04 01:09:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:16,992 INFO L225 Difference]: With dead ends: 1548 [2025-03-04 01:09:16,992 INFO L226 Difference]: Without dead ends: 960 [2025-03-04 01:09:16,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:09:16,994 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 374 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:16,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 536 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:09:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-04 01:09:17,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 702. [2025-03-04 01:09:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 573 states have (on average 1.2617801047120418) internal successors, (723), 578 states have internal predecessors, (723), 106 states have call successors, (106), 22 states have call predecessors, (106), 22 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-04 01:09:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 935 transitions. [2025-03-04 01:09:17,061 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 935 transitions. Word has length 115 [2025-03-04 01:09:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:17,061 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 935 transitions. [2025-03-04 01:09:17,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 935 transitions. [2025-03-04 01:09:17,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:09:17,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:17,062 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:17,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:09:17,063 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:17,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:17,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2130849245, now seen corresponding path program 1 times [2025-03-04 01:09:17,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:17,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692080312] [2025-03-04 01:09:17,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:17,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:17,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:09:17,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:09:17,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:17,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:17,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692080312] [2025-03-04 01:09:17,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692080312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:17,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:17,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:09:17,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521071934] [2025-03-04 01:09:17,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:17,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:09:17,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:17,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:09:17,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:17,287 INFO L87 Difference]: Start difference. First operand 702 states and 935 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:17,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:17,528 INFO L93 Difference]: Finished difference Result 1192 states and 1583 transitions. [2025-03-04 01:09:17,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:09:17,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-04 01:09:17,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:17,532 INFO L225 Difference]: With dead ends: 1192 [2025-03-04 01:09:17,532 INFO L226 Difference]: Without dead ends: 800 [2025-03-04 01:09:17,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:09:17,533 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 58 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:17,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 691 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:09:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-04 01:09:17,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 714. [2025-03-04 01:09:17,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 584 states have (on average 1.2636986301369864) internal successors, (738), 589 states have internal predecessors, (738), 106 states have call successors, (106), 23 states have call predecessors, (106), 23 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-04 01:09:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 950 transitions. [2025-03-04 01:09:17,606 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 950 transitions. Word has length 115 [2025-03-04 01:09:17,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:17,607 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 950 transitions. [2025-03-04 01:09:17,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 950 transitions. [2025-03-04 01:09:17,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:09:17,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:17,608 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:17,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:09:17,608 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:17,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:17,609 INFO L85 PathProgramCache]: Analyzing trace with hash 381780540, now seen corresponding path program 1 times [2025-03-04 01:09:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:17,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218990057] [2025-03-04 01:09:17,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:17,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:09:17,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:09:17,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:17,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:21,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:21,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218990057] [2025-03-04 01:09:21,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218990057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:21,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:21,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 01:09:21,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878811696] [2025-03-04 01:09:21,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:21,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:09:21,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:21,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:09:21,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:09:21,090 INFO L87 Difference]: Start difference. First operand 714 states and 950 transitions. Second operand has 19 states, 16 states have (on average 3.0) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 01:09:24,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:09:28,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:09:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:29,644 INFO L93 Difference]: Finished difference Result 1869 states and 2468 transitions. [2025-03-04 01:09:29,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 01:09:29,645 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.0) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 115 [2025-03-04 01:09:29,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:29,649 INFO L225 Difference]: With dead ends: 1869 [2025-03-04 01:09:29,650 INFO L226 Difference]: Without dead ends: 1381 [2025-03-04 01:09:29,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=1407, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 01:09:29,651 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 826 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 223 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:29,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1573 Invalid, 2468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 2244 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2025-03-04 01:09:29,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-03-04 01:09:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 857. [2025-03-04 01:09:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 697 states have (on average 1.2568149210903874) internal successors, (876), 704 states have internal predecessors, (876), 130 states have call successors, (130), 29 states have call predecessors, (130), 29 states have return successors, (130), 123 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-04 01:09:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1136 transitions. [2025-03-04 01:09:29,771 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1136 transitions. Word has length 115 [2025-03-04 01:09:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:29,772 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1136 transitions. [2025-03-04 01:09:29,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.0) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 01:09:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1136 transitions. [2025-03-04 01:09:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:09:29,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:29,773 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:29,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:09:29,774 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:29,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:29,774 INFO L85 PathProgramCache]: Analyzing trace with hash 301784643, now seen corresponding path program 1 times [2025-03-04 01:09:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:29,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965056129] [2025-03-04 01:09:29,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:29,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:29,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:09:29,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:09:29,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:29,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:30,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:30,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965056129] [2025-03-04 01:09:30,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965056129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:30,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:30,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:09:30,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130666957] [2025-03-04 01:09:30,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:30,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:09:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:30,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:09:30,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:09:30,049 INFO L87 Difference]: Start difference. First operand 857 states and 1136 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:30,618 INFO L93 Difference]: Finished difference Result 1875 states and 2492 transitions. [2025-03-04 01:09:30,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:09:30,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2025-03-04 01:09:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:30,622 INFO L225 Difference]: With dead ends: 1875 [2025-03-04 01:09:30,622 INFO L226 Difference]: Without dead ends: 1062 [2025-03-04 01:09:30,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:09:30,626 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 284 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:30,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 805 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:09:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-03-04 01:09:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 864. [2025-03-04 01:09:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 704 states have (on average 1.2400568181818181) internal successors, (873), 711 states have internal predecessors, (873), 130 states have call successors, (130), 29 states have call predecessors, (130), 29 states have return successors, (130), 123 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-04 01:09:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1133 transitions. [2025-03-04 01:09:30,736 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1133 transitions. Word has length 115 [2025-03-04 01:09:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:30,737 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1133 transitions. [2025-03-04 01:09:30,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1133 transitions. [2025-03-04 01:09:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:09:30,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:30,738 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:30,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:09:30,738 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:30,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash -208749534, now seen corresponding path program 1 times [2025-03-04 01:09:30,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:30,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403269026] [2025-03-04 01:09:30,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:30,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:30,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:09:30,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:09:30,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:30,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:33,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:33,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403269026] [2025-03-04 01:09:33,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403269026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:33,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:33,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:09:33,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164775627] [2025-03-04 01:09:33,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:33,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:09:33,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:33,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:09:33,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:09:33,979 INFO L87 Difference]: Start difference. First operand 864 states and 1133 transitions. Second operand has 18 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 18 states have internal predecessors, (48), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 01:09:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:38,544 INFO L93 Difference]: Finished difference Result 1623 states and 2132 transitions. [2025-03-04 01:09:38,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 01:09:38,545 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 18 states have internal predecessors, (48), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) Word has length 115 [2025-03-04 01:09:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:38,550 INFO L225 Difference]: With dead ends: 1623 [2025-03-04 01:09:38,550 INFO L226 Difference]: Without dead ends: 1130 [2025-03-04 01:09:38,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 01:09:38,552 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 333 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:38,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 2092 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-04 01:09:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-03-04 01:09:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 851. [2025-03-04 01:09:38,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 691 states have (on average 1.2402315484804631) internal successors, (857), 698 states have internal predecessors, (857), 130 states have call successors, (130), 29 states have call predecessors, (130), 29 states have return successors, (130), 123 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-04 01:09:38,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1117 transitions. [2025-03-04 01:09:38,674 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1117 transitions. Word has length 115 [2025-03-04 01:09:38,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:38,674 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1117 transitions. [2025-03-04 01:09:38,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 18 states have internal predecessors, (48), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 01:09:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1117 transitions. [2025-03-04 01:09:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:09:38,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:38,675 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:38,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:09:38,676 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:38,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:38,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1845700270, now seen corresponding path program 1 times [2025-03-04 01:09:38,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:38,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266226034] [2025-03-04 01:09:38,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:38,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:38,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:09:38,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:09:38,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:38,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:38,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:38,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266226034] [2025-03-04 01:09:38,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266226034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:38,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:38,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:09:38,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477675619] [2025-03-04 01:09:38,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:38,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:09:38,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:38,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:09:38,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:09:38,853 INFO L87 Difference]: Start difference. First operand 851 states and 1117 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:39,022 INFO L93 Difference]: Finished difference Result 1790 states and 2362 transitions. [2025-03-04 01:09:39,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:09:39,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2025-03-04 01:09:39,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:39,035 INFO L225 Difference]: With dead ends: 1790 [2025-03-04 01:09:39,039 INFO L226 Difference]: Without dead ends: 983 [2025-03-04 01:09:39,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:39,045 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 98 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:39,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 481 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-03-04 01:09:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 882. [2025-03-04 01:09:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 722 states have (on average 1.245152354570637) internal successors, (899), 729 states have internal predecessors, (899), 130 states have call successors, (130), 29 states have call predecessors, (130), 29 states have return successors, (130), 123 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-04 01:09:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1159 transitions. [2025-03-04 01:09:39,176 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1159 transitions. Word has length 116 [2025-03-04 01:09:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:39,176 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1159 transitions. [2025-03-04 01:09:39,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1159 transitions. [2025-03-04 01:09:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:09:39,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:39,177 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:39,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:09:39,177 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:39,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:39,178 INFO L85 PathProgramCache]: Analyzing trace with hash -959316212, now seen corresponding path program 1 times [2025-03-04 01:09:39,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:39,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685456155] [2025-03-04 01:09:39,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:39,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:39,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:09:39,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:09:39,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:39,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:39,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:39,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685456155] [2025-03-04 01:09:39,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685456155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:39,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:39,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:09:39,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791692732] [2025-03-04 01:09:39,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:39,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:09:39,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:39,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:09:39,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:09:39,437 INFO L87 Difference]: Start difference. First operand 882 states and 1159 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:39,649 INFO L93 Difference]: Finished difference Result 1722 states and 2264 transitions. [2025-03-04 01:09:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:09:39,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-03-04 01:09:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:39,653 INFO L225 Difference]: With dead ends: 1722 [2025-03-04 01:09:39,653 INFO L226 Difference]: Without dead ends: 884 [2025-03-04 01:09:39,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:09:39,654 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 62 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:39,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 268 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:09:39,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-03-04 01:09:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2025-03-04 01:09:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 722 states have (on average 1.2437673130193905) internal successors, (898), 729 states have internal predecessors, (898), 130 states have call successors, (130), 29 states have call predecessors, (130), 29 states have return successors, (130), 123 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-04 01:09:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1158 transitions. [2025-03-04 01:09:39,752 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1158 transitions. Word has length 116 [2025-03-04 01:09:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:39,753 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1158 transitions. [2025-03-04 01:09:39,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1158 transitions. [2025-03-04 01:09:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:09:39,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:39,753 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:39,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:09:39,754 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:39,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:39,754 INFO L85 PathProgramCache]: Analyzing trace with hash -338148461, now seen corresponding path program 1 times [2025-03-04 01:09:39,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:39,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588078141] [2025-03-04 01:09:39,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:39,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:39,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:09:39,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:09:39,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:39,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:39,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:39,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588078141] [2025-03-04 01:09:39,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588078141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:39,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:39,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:09:39,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135881159] [2025-03-04 01:09:39,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:39,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:09:39,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:39,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:09:39,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:09:39,857 INFO L87 Difference]: Start difference. First operand 882 states and 1158 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:40,052 INFO L93 Difference]: Finished difference Result 1765 states and 2315 transitions. [2025-03-04 01:09:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:09:40,052 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-03-04 01:09:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:40,056 INFO L225 Difference]: With dead ends: 1765 [2025-03-04 01:09:40,056 INFO L226 Difference]: Without dead ends: 927 [2025-03-04 01:09:40,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-04 01:09:40,057 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 33 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:40,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 411 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:09:40,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-04 01:09:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 860. [2025-03-04 01:09:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 700 states have (on average 1.23) internal successors, (861), 707 states have internal predecessors, (861), 130 states have call successors, (130), 29 states have call predecessors, (130), 29 states have return successors, (130), 123 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-04 01:09:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1121 transitions. [2025-03-04 01:09:40,155 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1121 transitions. Word has length 116 [2025-03-04 01:09:40,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:40,155 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1121 transitions. [2025-03-04 01:09:40,156 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1121 transitions. [2025-03-04 01:09:40,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:09:40,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:40,157 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:40,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:09:40,157 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:40,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash -366055527, now seen corresponding path program 1 times [2025-03-04 01:09:40,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:40,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378971877] [2025-03-04 01:09:40,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:40,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:09:40,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:09:40,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:40,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:41,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:41,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378971877] [2025-03-04 01:09:41,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378971877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:41,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:41,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:09:41,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275518080] [2025-03-04 01:09:41,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:41,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:09:41,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:41,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:09:41,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:09:41,135 INFO L87 Difference]: Start difference. First operand 860 states and 1121 transitions. Second operand has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:09:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:42,107 INFO L93 Difference]: Finished difference Result 977 states and 1268 transitions. [2025-03-04 01:09:42,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:09:42,107 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-03-04 01:09:42,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:42,111 INFO L225 Difference]: With dead ends: 977 [2025-03-04 01:09:42,111 INFO L226 Difference]: Without dead ends: 975 [2025-03-04 01:09:42,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:09:42,112 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 409 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:42,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 857 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:09:42,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-04 01:09:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 887. [2025-03-04 01:09:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 727 states have (on average 1.2214580467675378) internal successors, (888), 734 states have internal predecessors, (888), 130 states have call successors, (130), 29 states have call predecessors, (130), 29 states have return successors, (130), 123 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-04 01:09:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1148 transitions. [2025-03-04 01:09:42,210 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1148 transitions. Word has length 117 [2025-03-04 01:09:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:42,210 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1148 transitions. [2025-03-04 01:09:42,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:09:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1148 transitions. [2025-03-04 01:09:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:09:42,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:42,211 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:42,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:09:42,211 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:42,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:42,212 INFO L85 PathProgramCache]: Analyzing trace with hash -365132006, now seen corresponding path program 1 times [2025-03-04 01:09:42,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:42,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144478965] [2025-03-04 01:09:42,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:42,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:42,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:09:42,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:09:42,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:42,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:43,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144478965] [2025-03-04 01:09:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144478965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:43,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:43,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:09:43,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476799166] [2025-03-04 01:09:43,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:43,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:09:43,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:43,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:09:43,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:09:43,067 INFO L87 Difference]: Start difference. First operand 887 states and 1148 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:44,267 INFO L93 Difference]: Finished difference Result 1875 states and 2409 transitions. [2025-03-04 01:09:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:09:44,268 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-03-04 01:09:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:44,272 INFO L225 Difference]: With dead ends: 1875 [2025-03-04 01:09:44,272 INFO L226 Difference]: Without dead ends: 1032 [2025-03-04 01:09:44,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:09:44,273 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 436 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:44,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 659 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:09:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-03-04 01:09:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 923. [2025-03-04 01:09:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 754 states have (on average 1.2015915119363396) internal successors, (906), 761 states have internal predecessors, (906), 130 states have call successors, (130), 38 states have call predecessors, (130), 38 states have return successors, (130), 123 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-04 01:09:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1166 transitions. [2025-03-04 01:09:44,399 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1166 transitions. Word has length 117 [2025-03-04 01:09:44,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:44,399 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1166 transitions. [2025-03-04 01:09:44,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1166 transitions. [2025-03-04 01:09:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:09:44,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:44,400 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:44,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:09:44,402 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:44,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:44,402 INFO L85 PathProgramCache]: Analyzing trace with hash 522371675, now seen corresponding path program 1 times [2025-03-04 01:09:44,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:44,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170800924] [2025-03-04 01:09:44,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:44,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:44,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:09:44,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:09:44,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:44,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:09:44,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:44,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170800924] [2025-03-04 01:09:44,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170800924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:09:44,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159001424] [2025-03-04 01:09:44,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:44,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:44,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:09:44,598 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-04 01:09:44,600 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-04 01:09:44,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:09:44,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:09:44,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:44,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:44,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:09:44,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:09:44,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:09:44,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2025-03-04 01:09:44,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 34 [2025-03-04 01:09:44,913 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 21 treesize of output 17 [2025-03-04 01:09:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:45,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:09:45,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159001424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:45,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:09:45,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-04 01:09:45,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916283913] [2025-03-04 01:09:45,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:45,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:09:45,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:45,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:09:45,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:09:45,077 INFO L87 Difference]: Start difference. First operand 923 states and 1166 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:45,391 INFO L93 Difference]: Finished difference Result 1482 states and 1870 transitions. [2025-03-04 01:09:45,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:09:45,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-03-04 01:09:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:45,395 INFO L225 Difference]: With dead ends: 1482 [2025-03-04 01:09:45,395 INFO L226 Difference]: Without dead ends: 1020 [2025-03-04 01:09:45,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:09:45,396 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 163 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:45,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 837 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:09:45,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2025-03-04 01:09:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 768. [2025-03-04 01:09:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 626 states have (on average 1.1932907348242812) internal successors, (747), 631 states have internal predecessors, (747), 108 states have call successors, (108), 33 states have call predecessors, (108), 33 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:09:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 963 transitions. [2025-03-04 01:09:45,512 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 963 transitions. Word has length 117 [2025-03-04 01:09:45,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:45,512 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 963 transitions. [2025-03-04 01:09:45,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:45,512 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 963 transitions. [2025-03-04 01:09:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:09:45,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:45,513 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:45,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:09:45,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:45,713 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:45,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash -596293004, now seen corresponding path program 1 times [2025-03-04 01:09:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:45,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719393540] [2025-03-04 01:09:45,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:45,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:45,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:09:45,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:09:45,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:45,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719393540] [2025-03-04 01:09:46,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719393540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:46,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:46,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:09:46,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668937012] [2025-03-04 01:09:46,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:46,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:09:46,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:46,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:09:46,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:09:46,066 INFO L87 Difference]: Start difference. First operand 768 states and 963 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:46,654 INFO L93 Difference]: Finished difference Result 1262 states and 1594 transitions. [2025-03-04 01:09:46,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:09:46,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-03-04 01:09:46,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:46,658 INFO L225 Difference]: With dead ends: 1262 [2025-03-04 01:09:46,658 INFO L226 Difference]: Without dead ends: 935 [2025-03-04 01:09:46,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:09:46,658 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 258 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:46,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 589 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:09:46,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-04 01:09:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 770. [2025-03-04 01:09:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 628 states have (on average 1.1926751592356688) internal successors, (749), 633 states have internal predecessors, (749), 108 states have call successors, (108), 33 states have call predecessors, (108), 33 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:09:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 965 transitions. [2025-03-04 01:09:46,774 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 965 transitions. Word has length 118 [2025-03-04 01:09:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:46,775 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 965 transitions. [2025-03-04 01:09:46,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 965 transitions. [2025-03-04 01:09:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:09:46,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:46,775 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:46,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:09:46,775 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:46,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:46,776 INFO L85 PathProgramCache]: Analyzing trace with hash -551360009, now seen corresponding path program 1 times [2025-03-04 01:09:46,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:46,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288960811] [2025-03-04 01:09:46,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:46,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:46,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:09:46,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:09:46,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:46,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:46,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:46,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288960811] [2025-03-04 01:09:46,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288960811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:46,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:46,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:09:46,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213121896] [2025-03-04 01:09:46,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:46,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:09:46,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:46,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:09:46,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:46,968 INFO L87 Difference]: Start difference. First operand 770 states and 965 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:47,454 INFO L93 Difference]: Finished difference Result 1580 states and 1991 transitions. [2025-03-04 01:09:47,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:09:47,454 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-03-04 01:09:47,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:47,458 INFO L225 Difference]: With dead ends: 1580 [2025-03-04 01:09:47,458 INFO L226 Difference]: Without dead ends: 1021 [2025-03-04 01:09:47,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:09:47,459 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 183 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:47,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 585 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:09:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-03-04 01:09:47,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 777. [2025-03-04 01:09:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 635 states have (on average 1.1952755905511812) internal successors, (759), 640 states have internal predecessors, (759), 108 states have call successors, (108), 33 states have call predecessors, (108), 33 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:09:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 975 transitions. [2025-03-04 01:09:47,574 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 975 transitions. Word has length 118 [2025-03-04 01:09:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:47,574 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 975 transitions. [2025-03-04 01:09:47,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 975 transitions. [2025-03-04 01:09:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:09:47,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:47,575 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:47,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:09:47,575 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:47,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:47,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1223451251, now seen corresponding path program 1 times [2025-03-04 01:09:47,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:47,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509913424] [2025-03-04 01:09:47,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:47,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:47,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:09:47,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:09:47,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:47,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:47,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:47,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509913424] [2025-03-04 01:09:47,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509913424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:47,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:47,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:09:47,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366399688] [2025-03-04 01:09:47,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:47,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:09:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:47,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:09:47,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:09:47,812 INFO L87 Difference]: Start difference. First operand 777 states and 975 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:48,265 INFO L93 Difference]: Finished difference Result 1489 states and 1874 transitions. [2025-03-04 01:09:48,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:09:48,266 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-03-04 01:09:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:48,270 INFO L225 Difference]: With dead ends: 1489 [2025-03-04 01:09:48,270 INFO L226 Difference]: Without dead ends: 933 [2025-03-04 01:09:48,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:09:48,271 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 226 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:48,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 803 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:09:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-03-04 01:09:48,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 776. [2025-03-04 01:09:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 634 states have (on average 1.1892744479495267) internal successors, (754), 639 states have internal predecessors, (754), 108 states have call successors, (108), 33 states have call predecessors, (108), 33 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:09:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 970 transitions. [2025-03-04 01:09:48,427 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 970 transitions. Word has length 118 [2025-03-04 01:09:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:48,428 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 970 transitions. [2025-03-04 01:09:48,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 970 transitions. [2025-03-04 01:09:48,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:09:48,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:48,428 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:48,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:09:48,429 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:48,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:48,429 INFO L85 PathProgramCache]: Analyzing trace with hash 956191800, now seen corresponding path program 1 times [2025-03-04 01:09:48,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:48,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056253797] [2025-03-04 01:09:48,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:48,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:48,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:09:48,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:09:48,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:48,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:48,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:48,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056253797] [2025-03-04 01:09:48,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056253797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:48,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:48,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:09:48,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925681068] [2025-03-04 01:09:48,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:48,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:09:48,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:48,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:09:48,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:09:48,744 INFO L87 Difference]: Start difference. First operand 776 states and 970 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:49,317 INFO L93 Difference]: Finished difference Result 1495 states and 1872 transitions. [2025-03-04 01:09:49,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:09:49,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-03-04 01:09:49,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:49,320 INFO L225 Difference]: With dead ends: 1495 [2025-03-04 01:09:49,320 INFO L226 Difference]: Without dead ends: 924 [2025-03-04 01:09:49,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:09:49,322 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 200 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:49,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 632 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:09:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-03-04 01:09:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 774. [2025-03-04 01:09:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 632 states have (on average 1.1819620253164558) internal successors, (747), 637 states have internal predecessors, (747), 108 states have call successors, (108), 33 states have call predecessors, (108), 33 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:09:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 963 transitions. [2025-03-04 01:09:49,439 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 963 transitions. Word has length 118 [2025-03-04 01:09:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:49,439 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 963 transitions. [2025-03-04 01:09:49,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 963 transitions. [2025-03-04 01:09:49,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:09:49,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:49,440 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:49,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:09:49,440 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:49,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1316339096, now seen corresponding path program 1 times [2025-03-04 01:09:49,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:49,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606977907] [2025-03-04 01:09:49,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:49,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:49,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:09:49,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:09:49,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:49,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:49,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:49,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606977907] [2025-03-04 01:09:49,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606977907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:49,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:49,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:09:49,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582727938] [2025-03-04 01:09:49,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:49,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:09:49,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:49,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:09:49,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:09:49,962 INFO L87 Difference]: Start difference. First operand 774 states and 963 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:51,110 INFO L93 Difference]: Finished difference Result 1556 states and 1935 transitions. [2025-03-04 01:09:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:09:51,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-03-04 01:09:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:51,114 INFO L225 Difference]: With dead ends: 1556 [2025-03-04 01:09:51,114 INFO L226 Difference]: Without dead ends: 1002 [2025-03-04 01:09:51,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:09:51,115 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 315 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:51,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 719 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:09:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-03-04 01:09:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 876. [2025-03-04 01:09:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 721 states have (on average 1.176144244105409) internal successors, (848), 727 states have internal predecessors, (848), 118 states have call successors, (118), 36 states have call predecessors, (118), 36 states have return successors, (118), 112 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-04 01:09:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1084 transitions. [2025-03-04 01:09:51,267 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1084 transitions. Word has length 119 [2025-03-04 01:09:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:51,267 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1084 transitions. [2025-03-04 01:09:51,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:09:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1084 transitions. [2025-03-04 01:09:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:09:51,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:51,268 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:51,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:09:51,268 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:51,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:51,268 INFO L85 PathProgramCache]: Analyzing trace with hash 832889151, now seen corresponding path program 1 times [2025-03-04 01:09:51,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:51,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64755183] [2025-03-04 01:09:51,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:51,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:51,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:09:51,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:09:51,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:51,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:51,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:51,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64755183] [2025-03-04 01:09:51,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64755183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:51,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:51,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:09:51,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466787] [2025-03-04 01:09:51,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:51,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:09:51,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:51,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:09:51,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:51,547 INFO L87 Difference]: Start difference. First operand 876 states and 1084 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:51,941 INFO L93 Difference]: Finished difference Result 1812 states and 2238 transitions. [2025-03-04 01:09:51,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:09:51,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-04 01:09:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:51,945 INFO L225 Difference]: With dead ends: 1812 [2025-03-04 01:09:51,945 INFO L226 Difference]: Without dead ends: 980 [2025-03-04 01:09:51,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:09:51,946 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 157 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:51,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 788 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:09:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2025-03-04 01:09:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 892. [2025-03-04 01:09:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 737 states have (on average 1.175033921302578) internal successors, (866), 743 states have internal predecessors, (866), 118 states have call successors, (118), 36 states have call predecessors, (118), 36 states have return successors, (118), 112 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-04 01:09:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1102 transitions. [2025-03-04 01:09:52,086 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1102 transitions. Word has length 119 [2025-03-04 01:09:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:52,086 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1102 transitions. [2025-03-04 01:09:52,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1102 transitions. [2025-03-04 01:09:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:09:52,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:52,087 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:52,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 01:09:52,087 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:52,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash -964062208, now seen corresponding path program 1 times [2025-03-04 01:09:52,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:52,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59082017] [2025-03-04 01:09:52,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:52,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:09:52,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:09:52,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:52,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:52,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:52,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59082017] [2025-03-04 01:09:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59082017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:52,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:52,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:09:52,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185145856] [2025-03-04 01:09:52,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:52,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:09:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:52,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:09:52,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:09:52,380 INFO L87 Difference]: Start difference. First operand 892 states and 1102 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:52,827 INFO L93 Difference]: Finished difference Result 2050 states and 2532 transitions. [2025-03-04 01:09:52,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:09:52,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-04 01:09:52,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:52,832 INFO L225 Difference]: With dead ends: 2050 [2025-03-04 01:09:52,832 INFO L226 Difference]: Without dead ends: 1202 [2025-03-04 01:09:52,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:09:52,834 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 205 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:52,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 655 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:09:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2025-03-04 01:09:52,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1079. [2025-03-04 01:09:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 924 states have (on average 1.1893939393939394) internal successors, (1099), 929 states have internal predecessors, (1099), 118 states have call successors, (118), 36 states have call predecessors, (118), 36 states have return successors, (118), 113 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-04 01:09:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1335 transitions. [2025-03-04 01:09:52,988 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1335 transitions. Word has length 119 [2025-03-04 01:09:52,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:52,988 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1335 transitions. [2025-03-04 01:09:52,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1335 transitions. [2025-03-04 01:09:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:09:52,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:52,989 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:52,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 01:09:52,989 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:52,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2077653632, now seen corresponding path program 1 times [2025-03-04 01:09:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:52,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754497806] [2025-03-04 01:09:52,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:52,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:09:53,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:09:53,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:53,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:53,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:53,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754497806] [2025-03-04 01:09:53,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754497806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:53,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:53,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:09:53,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555988469] [2025-03-04 01:09:53,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:53,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:09:53,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:53,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:09:53,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:53,246 INFO L87 Difference]: Start difference. First operand 1079 states and 1335 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:53,636 INFO L93 Difference]: Finished difference Result 1949 states and 2405 transitions. [2025-03-04 01:09:53,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:09:53,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-04 01:09:53,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:53,640 INFO L225 Difference]: With dead ends: 1949 [2025-03-04 01:09:53,640 INFO L226 Difference]: Without dead ends: 1068 [2025-03-04 01:09:53,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:09:53,641 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 99 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:53,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 566 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:09:53,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2025-03-04 01:09:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1066. [2025-03-04 01:09:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 911 states have (on average 1.1888035126234906) internal successors, (1083), 916 states have internal predecessors, (1083), 118 states have call successors, (118), 36 states have call predecessors, (118), 36 states have return successors, (118), 113 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-04 01:09:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1319 transitions. [2025-03-04 01:09:53,793 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1319 transitions. Word has length 119 [2025-03-04 01:09:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:53,793 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1319 transitions. [2025-03-04 01:09:53,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:09:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1319 transitions. [2025-03-04 01:09:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 01:09:53,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:53,793 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:53,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 01:09:53,794 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:53,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:53,794 INFO L85 PathProgramCache]: Analyzing trace with hash 871532946, now seen corresponding path program 1 times [2025-03-04 01:09:53,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:53,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20751901] [2025-03-04 01:09:53,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:53,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:53,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:09:53,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:09:53,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:53,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:54,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:54,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20751901] [2025-03-04 01:09:54,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20751901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:54,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:54,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:09:54,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278133258] [2025-03-04 01:09:54,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:54,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:09:54,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:54,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:09:54,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:54,244 INFO L87 Difference]: Start difference. First operand 1066 states and 1319 transitions. Second operand has 7 states, 5 states have (on average 10.6) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:09:54,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:54,753 INFO L93 Difference]: Finished difference Result 1540 states and 1912 transitions. [2025-03-04 01:09:54,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:09:54,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.6) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-03-04 01:09:54,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:54,758 INFO L225 Difference]: With dead ends: 1540 [2025-03-04 01:09:54,758 INFO L226 Difference]: Without dead ends: 1106 [2025-03-04 01:09:54,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:09:54,759 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 58 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:54,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 508 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:09:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-03-04 01:09:54,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 892. [2025-03-04 01:09:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 765 states have (on average 1.188235294117647) internal successors, (909), 768 states have internal predecessors, (909), 96 states have call successors, (96), 30 states have call predecessors, (96), 30 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 01:09:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1101 transitions. [2025-03-04 01:09:54,877 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1101 transitions. Word has length 120 [2025-03-04 01:09:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:54,877 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1101 transitions. [2025-03-04 01:09:54,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.6) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:09:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1101 transitions. [2025-03-04 01:09:54,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:09:54,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:54,879 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:54,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 01:09:54,879 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:54,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:54,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1574363162, now seen corresponding path program 1 times [2025-03-04 01:09:54,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:54,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274278113] [2025-03-04 01:09:54,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:54,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:54,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:09:54,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:09:54,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:54,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:09:55,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:55,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274278113] [2025-03-04 01:09:55,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274278113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:55,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:55,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:09:55,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667022064] [2025-03-04 01:09:55,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:55,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:09:55,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:55,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:09:55,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:09:55,511 INFO L87 Difference]: Start difference. First operand 892 states and 1101 transitions. Second operand has 14 states, 12 states have (on average 4.5) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:09:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:56,157 INFO L93 Difference]: Finished difference Result 1812 states and 2240 transitions. [2025-03-04 01:09:56,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:09:56,158 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-03-04 01:09:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:56,162 INFO L225 Difference]: With dead ends: 1812 [2025-03-04 01:09:56,162 INFO L226 Difference]: Without dead ends: 1289 [2025-03-04 01:09:56,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:09:56,163 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 67 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:56,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1401 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:09:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2025-03-04 01:09:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1266. [2025-03-04 01:09:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1121 states have (on average 1.1962533452274755) internal successors, (1341), 1127 states have internal predecessors, (1341), 108 states have call successors, (108), 36 states have call predecessors, (108), 36 states have return successors, (108), 102 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:09:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1557 transitions. [2025-03-04 01:09:56,313 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1557 transitions. Word has length 121 [2025-03-04 01:09:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:56,314 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1557 transitions. [2025-03-04 01:09:56,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:09:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1557 transitions. [2025-03-04 01:09:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:09:56,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:56,314 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:09:56,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 01:09:56,315 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:56,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:56,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1570072885, now seen corresponding path program 1 times [2025-03-04 01:09:56,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:56,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886327397] [2025-03-04 01:09:56,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:56,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:56,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:09:56,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:09:56,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:56,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat