./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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-12.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6426d30449276f41292d944281f990de88775c0c256461a4ce5af87d5d4d093f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:02:10,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:02:10,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:02:10,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:02:10,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:02:10,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:02:10,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:02:10,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:02:10,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:02:10,653 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:02:10,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:02:10,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:02:10,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:02:10,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:02:10,653 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:02:10,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:02:10,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:02:10,654 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:02:10,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:02:10,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:02:10,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:02:10,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:02:10,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:02:10,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:02:10,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:02:10,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:02:10,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:02:10,655 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:02:10,655 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:02:10,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:02:10,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:02:10,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:02:10,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:02:10,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:02:10,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:02:10,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:02:10,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:02:10,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:02:10,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:02:10,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:02:10,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:02:10,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:02:10,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:02:10,656 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6426d30449276f41292d944281f990de88775c0c256461a4ce5af87d5d4d093f [2025-03-04 01:02:10,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:02:10,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:02:10,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:02:10,888 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:02:10,889 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:02:10,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i [2025-03-04 01:02:12,012 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a39c07de/80ae8387a828491ea3f93f2661f32cd1/FLAGce3c2444f [2025-03-04 01:02:12,312 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:02:12,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i [2025-03-04 01:02:12,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a39c07de/80ae8387a828491ea3f93f2661f32cd1/FLAGce3c2444f [2025-03-04 01:02:12,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a39c07de/80ae8387a828491ea3f93f2661f32cd1 [2025-03-04 01:02:12,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:02:12,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:02:12,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:02:12,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:02:12,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:02:12,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:02:12" (1/1) ... [2025-03-04 01:02:12,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547dfb53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:12, skipping insertion in model container [2025-03-04 01:02:12,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:02:12" (1/1) ... [2025-03-04 01:02:12,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:02:12,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i[916,929] [2025-03-04 01:02:12,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:02:12,814 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:02:12,823 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i[916,929] [2025-03-04 01:02:12,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:02:12,875 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:02:12,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:12 WrapperNode [2025-03-04 01:02:12,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:02:12,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:02:12,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:02:12,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:02:12,881 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:02:12" (1/1) ... [2025-03-04 01:02:12,895 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:02:12" (1/1) ... [2025-03-04 01:02:12,937 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 444 [2025-03-04 01:02:12,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:02:12,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:02:12,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:02:12,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:02:12,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:12" (1/1) ... [2025-03-04 01:02:12,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:12" (1/1) ... [2025-03-04 01:02:12,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:12" (1/1) ... [2025-03-04 01:02:12,962 INFO L175 MemorySlicer]: Split 123 memory accesses to 4 slices as follows [2, 38, 12, 71]. 58 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 2, 4]. The 14 writes are split as follows [0, 8, 2, 4]. [2025-03-04 01:02:12,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:12" (1/1) ... [2025-03-04 01:02:12,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:12" (1/1) ... [2025-03-04 01:02:12,978 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:12" (1/1) ... [2025-03-04 01:02:12,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:12" (1/1) ... [2025-03-04 01:02:12,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:12" (1/1) ... [2025-03-04 01:02:12,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:12" (1/1) ... [2025-03-04 01:02:12,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:02:12,990 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:02:12,990 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:02:12,990 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:02:12,991 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:12" (1/1) ... [2025-03-04 01:02:12,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:02:13,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:13,021 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:02:13,024 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:02:13,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:02:13,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:02:13,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:02:13,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:02:13,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:02:13,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:02:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:02:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:02:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:02:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:02:13,043 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:02:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:02:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:02:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:02:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:02:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:02:13,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:02:13,127 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:02:13,129 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:02:13,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~mem71#1;havoc property_#t~ite82#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite81#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem79#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite103#1;havoc property_#t~mem96#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short106#1;havoc property_#t~mem109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem110#1;havoc property_#t~ite126#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite123#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short117#1;havoc property_#t~short119#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short127#1; [2025-03-04 01:02:13,549 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-03-04 01:02:13,550 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:02:13,560 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:02:13,561 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:02:13,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:02:13 BoogieIcfgContainer [2025-03-04 01:02:13,562 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:02:13,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:02:13,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:02:13,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:02:13,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:02:12" (1/3) ... [2025-03-04 01:02:13,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162ad9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:02:13, skipping insertion in model container [2025-03-04 01:02:13,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:12" (2/3) ... [2025-03-04 01:02:13,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162ad9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:02:13, skipping insertion in model container [2025-03-04 01:02:13,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:02:13" (3/3) ... [2025-03-04 01:02:13,571 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-12.i [2025-03-04 01:02:13,584 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:02:13,585 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-12.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:02:13,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:02:13,633 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;@505a3ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:02:13,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:02:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:02:13,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:13,643 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:13,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:13,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:13,647 INFO L85 PathProgramCache]: Analyzing trace with hash 825168545, now seen corresponding path program 1 times [2025-03-04 01:02:13,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:13,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410032648] [2025-03-04 01:02:13,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:13,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:13,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:02:13,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:02:13,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:13,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-04 01:02:13,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:13,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410032648] [2025-03-04 01:02:13,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410032648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:13,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677861868] [2025-03-04 01:02:13,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:13,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:13,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:13,849 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:02:13,850 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:02:13,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:02:14,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:02:14,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:14,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:14,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:02:14,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-04 01:02:14,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:14,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677861868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:14,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:02:14,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:02:14,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120715343] [2025-03-04 01:02:14,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:14,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:02:14,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:14,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:02:14,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:02:14,084 INFO L87 Difference]: Start difference. First operand has 97 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:14,108 INFO L93 Difference]: Finished difference Result 182 states and 281 transitions. [2025-03-04 01:02:14,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:02:14,110 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 117 [2025-03-04 01:02:14,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:14,115 INFO L225 Difference]: With dead ends: 182 [2025-03-04 01:02:14,115 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 01:02:14,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:02:14,122 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:14,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:14,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 01:02:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-04 01:02:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2025-03-04 01:02:14,154 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 117 [2025-03-04 01:02:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:14,154 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2025-03-04 01:02:14,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2025-03-04 01:02:14,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:02:14,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:14,157 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:14,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:02:14,358 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:02:14,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:14,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:14,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1491333777, now seen corresponding path program 1 times [2025-03-04 01:02:14,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:14,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880094322] [2025-03-04 01:02:14,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:14,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:14,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:02:14,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:02:14,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:14,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:02:14,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:14,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880094322] [2025-03-04 01:02:14,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880094322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:14,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749598678] [2025-03-04 01:02:14,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:14,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:14,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:14,722 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:02:14,723 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:02:14,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:02:14,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:02:14,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:14,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:14,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:02:14,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:14,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:14,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749598678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:14,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:02:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:02:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319220445] [2025-03-04 01:02:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:14,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:02:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:14,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:02:14,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:02:14,909 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:14,945 INFO L93 Difference]: Finished difference Result 173 states and 243 transitions. [2025-03-04 01:02:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:02:14,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2025-03-04 01:02:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:14,948 INFO L225 Difference]: With dead ends: 173 [2025-03-04 01:02:14,949 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 01:02:14,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:02:14,950 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:14,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 01:02:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-04 01:02:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2025-03-04 01:02:14,962 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 117 [2025-03-04 01:02:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:14,965 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2025-03-04 01:02:14,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2025-03-04 01:02:14,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:02:14,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:14,968 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:14,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:02:15,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 01:02:15,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:15,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:15,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1309974883, now seen corresponding path program 1 times [2025-03-04 01:02:15,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:15,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093650300] [2025-03-04 01:02:15,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:15,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:15,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:02:15,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:02:15,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:15,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:02:15,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:15,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093650300] [2025-03-04 01:02:15,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093650300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:15,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916773250] [2025-03-04 01:02:15,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:15,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:15,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:15,423 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:02:15,425 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:02:15,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:02:15,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:02:15,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:15,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:15,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:02:15,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:15,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:15,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916773250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:15,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:02:15,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:02:15,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421728185] [2025-03-04 01:02:15,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:15,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:02:15,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:15,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:02:15,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:02:15,591 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:15,634 INFO L93 Difference]: Finished difference Result 176 states and 245 transitions. [2025-03-04 01:02:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:02:15,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-03-04 01:02:15,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:15,637 INFO L225 Difference]: With dead ends: 176 [2025-03-04 01:02:15,637 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 01:02:15,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:02:15,638 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:15,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 461 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 01:02:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-04 01:02:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2025-03-04 01:02:15,652 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 119 [2025-03-04 01:02:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:15,652 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2025-03-04 01:02:15,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2025-03-04 01:02:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:02:15,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:15,656 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:15,663 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:02:15,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:15,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:15,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:15,857 INFO L85 PathProgramCache]: Analyzing trace with hash -79662761, now seen corresponding path program 1 times [2025-03-04 01:02:15,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:15,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050068517] [2025-03-04 01:02:15,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:15,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:15,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:02:15,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:02:15,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:15,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:17,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:17,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050068517] [2025-03-04 01:02:17,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050068517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:17,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:17,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:02:17,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650814301] [2025-03-04 01:02:17,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:17,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:02:17,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:17,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:02:17,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:02:17,098 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:17,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:17,287 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2025-03-04 01:02:17,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:02:17,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 121 [2025-03-04 01:02:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:17,289 INFO L225 Difference]: With dead ends: 133 [2025-03-04 01:02:17,290 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 01:02:17,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:02:17,291 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 36 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:17,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 767 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:02:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 01:02:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2025-03-04 01:02:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 98 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2025-03-04 01:02:17,304 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 121 [2025-03-04 01:02:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:17,304 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2025-03-04 01:02:17,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2025-03-04 01:02:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:02:17,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:17,306 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:17,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:02:17,306 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:17,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:17,307 INFO L85 PathProgramCache]: Analyzing trace with hash 939240366, now seen corresponding path program 1 times [2025-03-04 01:02:17,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:17,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432012546] [2025-03-04 01:02:17,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:17,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:17,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:02:17,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:02:17,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:17,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-04 01:02:18,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:18,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432012546] [2025-03-04 01:02:18,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432012546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:18,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071200282] [2025-03-04 01:02:18,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:18,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:18,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:18,990 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:18,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:02:19,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:02:19,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:02:19,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:19,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:19,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-04 01:02:19,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:19,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-04 01:02:19,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2025-03-04 01:02:19,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:19,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2025-03-04 01:02:20,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:20,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2025-03-04 01:02:20,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:20,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 34 [2025-03-04 01:02:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 32 proven. 184 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:02:20,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:02:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-04 01:02:21,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071200282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:02:21,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:02:21,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 23] total 58 [2025-03-04 01:02:21,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582533161] [2025-03-04 01:02:21,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:02:21,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-04 01:02:21,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:21,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-04 01:02:21,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=2843, Unknown=0, NotChecked=0, Total=3306 [2025-03-04 01:02:21,790 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 58 states, 46 states have (on average 3.3260869565217392) internal successors, (153), 48 states have internal predecessors, (153), 15 states have call successors, (48), 6 states have call predecessors, (48), 11 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48) [2025-03-04 01:02:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:24,655 INFO L93 Difference]: Finished difference Result 263 states and 333 transitions. [2025-03-04 01:02:24,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-04 01:02:24,656 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 46 states have (on average 3.3260869565217392) internal successors, (153), 48 states have internal predecessors, (153), 15 states have call successors, (48), 6 states have call predecessors, (48), 11 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48) Word has length 122 [2025-03-04 01:02:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:24,658 INFO L225 Difference]: With dead ends: 263 [2025-03-04 01:02:24,658 INFO L226 Difference]: Without dead ends: 261 [2025-03-04 01:02:24,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 214 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3579 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1770, Invalid=10440, Unknown=0, NotChecked=0, Total=12210 [2025-03-04 01:02:24,666 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1513 mSDsluCounter, 2267 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:24,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 2385 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:02:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-04 01:02:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 132. [2025-03-04 01:02:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.2454545454545454) internal successors, (137), 110 states have internal predecessors, (137), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 169 transitions. [2025-03-04 01:02:24,690 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 169 transitions. Word has length 122 [2025-03-04 01:02:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:24,690 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 169 transitions. [2025-03-04 01:02:24,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 46 states have (on average 3.3260869565217392) internal successors, (153), 48 states have internal predecessors, (153), 15 states have call successors, (48), 6 states have call predecessors, (48), 11 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48) [2025-03-04 01:02:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 169 transitions. [2025-03-04 01:02:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:02:24,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:24,692 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:24,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:02:24,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:24,896 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:24,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:24,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1530609216, now seen corresponding path program 1 times [2025-03-04 01:02:24,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:24,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787141241] [2025-03-04 01:02:24,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:24,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:24,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:02:24,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:02:24,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:24,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-04 01:02:26,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:26,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787141241] [2025-03-04 01:02:26,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787141241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:26,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087733160] [2025-03-04 01:02:26,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:26,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:26,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:26,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:26,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:02:26,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:02:26,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:02:26,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:26,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:26,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-04 01:02:26,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:26,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 01:02:26,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:02:26,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:26,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-04 01:02:27,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:27,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2025-03-04 01:02:27,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:27,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 34 [2025-03-04 01:02:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 144 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:02:27,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:02:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-04 01:02:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087733160] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:02:28,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:02:28,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26, 26] total 58 [2025-03-04 01:02:28,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243895843] [2025-03-04 01:02:28,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:02:28,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-04 01:02:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:28,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-04 01:02:28,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=2856, Unknown=0, NotChecked=0, Total=3306 [2025-03-04 01:02:28,193 INFO L87 Difference]: Start difference. First operand 132 states and 169 transitions. Second operand has 58 states, 46 states have (on average 3.239130434782609) internal successors, (149), 51 states have internal predecessors, (149), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48) [2025-03-04 01:02:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:30,481 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2025-03-04 01:02:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-04 01:02:30,482 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 46 states have (on average 3.239130434782609) internal successors, (149), 51 states have internal predecessors, (149), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48) Word has length 123 [2025-03-04 01:02:30,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:30,484 INFO L225 Difference]: With dead ends: 213 [2025-03-04 01:02:30,484 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 01:02:30,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 216 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2780 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1557, Invalid=8343, Unknown=0, NotChecked=0, Total=9900 [2025-03-04 01:02:30,486 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 1222 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:30,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 2053 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:02:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 01:02:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 134. [2025-03-04 01:02:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.25) internal successors, (140), 112 states have internal predecessors, (140), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2025-03-04 01:02:30,503 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 123 [2025-03-04 01:02:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:30,504 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2025-03-04 01:02:30,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 46 states have (on average 3.239130434782609) internal successors, (149), 51 states have internal predecessors, (149), 15 states have call successors, (48), 5 states have call predecessors, (48), 10 states have return successors, (48), 10 states have call predecessors, (48), 15 states have call successors, (48) [2025-03-04 01:02:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2025-03-04 01:02:30,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:02:30,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:30,505 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:30,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:02:30,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:30,706 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:30,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1807300440, now seen corresponding path program 1 times [2025-03-04 01:02:30,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:30,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966554798] [2025-03-04 01:02:30,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:30,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:02:30,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:02:30,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:30,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:02:30,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:30,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966554798] [2025-03-04 01:02:30,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966554798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:30,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194213821] [2025-03-04 01:02:30,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:30,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:30,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:30,954 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:30,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:02:31,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:02:31,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:02:31,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:31,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:31,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 01:02:31,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:31,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2025-03-04 01:02:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-04 01:02:31,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:02:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:02:31,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194213821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:02:31,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:02:31,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2025-03-04 01:02:31,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34904803] [2025-03-04 01:02:31,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:02:31,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:02:31,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:31,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:02:31,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:02:31,378 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-04 01:02:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:31,628 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2025-03-04 01:02:31,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:02:31,628 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) Word has length 124 [2025-03-04 01:02:31,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:31,629 INFO L225 Difference]: With dead ends: 273 [2025-03-04 01:02:31,629 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 01:02:31,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:02:31,630 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 150 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:31,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 423 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:02:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 01:02:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2025-03-04 01:02:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 115 states have internal predecessors, (142), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions. [2025-03-04 01:02:31,640 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 124 [2025-03-04 01:02:31,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:31,640 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 174 transitions. [2025-03-04 01:02:31,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-04 01:02:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions. [2025-03-04 01:02:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:02:31,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:31,642 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:31,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 01:02:31,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:31,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:31,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:31,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1805566955, now seen corresponding path program 1 times [2025-03-04 01:02:31,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:31,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354682427] [2025-03-04 01:02:31,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:31,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:31,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:02:31,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:02:31,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:31,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:31,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:31,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354682427] [2025-03-04 01:02:31,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354682427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:31,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:31,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:02:31,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807324527] [2025-03-04 01:02:31,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:31,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:02:31,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:31,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:02:31,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:02:31,912 INFO L87 Difference]: Start difference. First operand 138 states and 174 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:31,971 INFO L93 Difference]: Finished difference Result 355 states and 439 transitions. [2025-03-04 01:02:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:02:31,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2025-03-04 01:02:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:31,973 INFO L225 Difference]: With dead ends: 355 [2025-03-04 01:02:31,973 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 01:02:31,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:02:31,974 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 53 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:31,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 506 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 01:02:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 159. [2025-03-04 01:02:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 136 states have (on average 1.2205882352941178) internal successors, (166), 136 states have internal predecessors, (166), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 198 transitions. [2025-03-04 01:02:31,986 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 198 transitions. Word has length 124 [2025-03-04 01:02:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:31,986 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 198 transitions. [2025-03-04 01:02:31,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 198 transitions. [2025-03-04 01:02:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:02:31,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:31,988 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:31,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:02:31,988 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:31,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash -821114822, now seen corresponding path program 1 times [2025-03-04 01:02:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:31,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730491146] [2025-03-04 01:02:31,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:31,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:31,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:02:32,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:02:32,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:32,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:02:32,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:32,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730491146] [2025-03-04 01:02:32,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730491146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:32,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865011343] [2025-03-04 01:02:32,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:32,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:32,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:32,338 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:32,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 01:02:32,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:02:32,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:02:32,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:32,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:32,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 01:02:32,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:32,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:32,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2025-03-04 01:02:32,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:32,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 26 [2025-03-04 01:02:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-04 01:02:32,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:02:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:02:32,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865011343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:02:32,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:02:32,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2025-03-04 01:02:32,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753145694] [2025-03-04 01:02:32,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:02:32,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:02:32,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:32,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:02:32,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:02:32,840 INFO L87 Difference]: Start difference. First operand 159 states and 198 transitions. Second operand has 13 states, 10 states have (on average 8.1) internal successors, (81), 13 states have internal predecessors, (81), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-04 01:02:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:33,168 INFO L93 Difference]: Finished difference Result 367 states and 455 transitions. [2025-03-04 01:02:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:02:33,169 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 8.1) internal successors, (81), 13 states have internal predecessors, (81), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) Word has length 125 [2025-03-04 01:02:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:33,171 INFO L225 Difference]: With dead ends: 367 [2025-03-04 01:02:33,171 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 01:02:33,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:02:33,172 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 391 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:33,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 494 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:02:33,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 01:02:33,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 159. [2025-03-04 01:02:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 136 states have (on average 1.213235294117647) internal successors, (165), 136 states have internal predecessors, (165), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 197 transitions. [2025-03-04 01:02:33,183 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 197 transitions. Word has length 125 [2025-03-04 01:02:33,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:33,183 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 197 transitions. [2025-03-04 01:02:33,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 8.1) internal successors, (81), 13 states have internal predecessors, (81), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-04 01:02:33,183 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 197 transitions. [2025-03-04 01:02:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:02:33,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:33,184 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:33,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 01:02:33,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:33,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:33,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2035570058, now seen corresponding path program 1 times [2025-03-04 01:02:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:33,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104617116] [2025-03-04 01:02:33,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:33,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:33,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:02:33,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:02:33,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:33,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:02:33,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508324487] [2025-03-04 01:02:33,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:33,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:33,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:33,435 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:33,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 01:02:33,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:02:33,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:02:33,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:33,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:33,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 01:02:33,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:33,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 01:02:33,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 01:02:33,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 01:02:33,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:33,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 01:02:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:33,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:33,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:33,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104617116] [2025-03-04 01:02:33,878 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:02:33,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508324487] [2025-03-04 01:02:33,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508324487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:33,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:33,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:02:33,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461649817] [2025-03-04 01:02:33,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:33,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:02:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:33,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:02:33,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:02:33,880 INFO L87 Difference]: Start difference. First operand 159 states and 197 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:33,959 INFO L93 Difference]: Finished difference Result 417 states and 513 transitions. [2025-03-04 01:02:33,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:02:33,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2025-03-04 01:02:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:33,962 INFO L225 Difference]: With dead ends: 417 [2025-03-04 01:02:33,962 INFO L226 Difference]: Without dead ends: 261 [2025-03-04 01:02:33,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:02:33,964 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 51 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:33,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 279 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:02:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-04 01:02:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2025-03-04 01:02:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 204 states have (on average 1.1715686274509804) internal successors, (239), 204 states have internal predecessors, (239), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:02:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2025-03-04 01:02:33,984 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 126 [2025-03-04 01:02:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:33,984 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2025-03-04 01:02:33,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2025-03-04 01:02:33,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:02:33,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:33,985 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:33,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 01:02:34,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 01:02:34,186 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:34,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:34,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1208991588, now seen corresponding path program 1 times [2025-03-04 01:02:34,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:34,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728509042] [2025-03-04 01:02:34,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:34,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:34,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:02:34,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:02:34,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:34,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:02:34,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [687502448] [2025-03-04 01:02:34,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:34,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:34,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:34,238 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:34,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 01:02:34,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:02:34,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:02:34,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:34,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:34,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 01:02:34,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:34,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:02:34,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:02:34,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:02:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:34,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:34,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:34,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728509042] [2025-03-04 01:02:34,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:02:34,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687502448] [2025-03-04 01:02:34,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687502448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:34,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:34,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:02:34,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729771472] [2025-03-04 01:02:34,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:34,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:02:34,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:34,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:02:34,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:02:34,519 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:34,612 INFO L93 Difference]: Finished difference Result 493 states and 603 transitions. [2025-03-04 01:02:34,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:02:34,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2025-03-04 01:02:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:34,614 INFO L225 Difference]: With dead ends: 493 [2025-03-04 01:02:34,614 INFO L226 Difference]: Without dead ends: 247 [2025-03-04 01:02:34,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:02:34,615 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 22 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:34,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 277 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:02:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-04 01:02:34,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 240. [2025-03-04 01:02:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 195 states have (on average 1.1641025641025642) internal successors, (227), 195 states have internal predecessors, (227), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:02:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 291 transitions. [2025-03-04 01:02:34,640 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 291 transitions. Word has length 127 [2025-03-04 01:02:34,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:34,641 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 291 transitions. [2025-03-04 01:02:34,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 291 transitions. [2025-03-04 01:02:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:34,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:34,642 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:34,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 01:02:34,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:34,845 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:34,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:34,847 INFO L85 PathProgramCache]: Analyzing trace with hash 893535468, now seen corresponding path program 1 times [2025-03-04 01:02:34,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:34,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691567567] [2025-03-04 01:02:34,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:34,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:34,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:34,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:34,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:34,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:35,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:35,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691567567] [2025-03-04 01:02:35,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691567567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:35,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:35,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:02:35,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327743622] [2025-03-04 01:02:35,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:35,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:02:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:35,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:02:35,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:02:35,542 INFO L87 Difference]: Start difference. First operand 240 states and 291 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:36,140 INFO L93 Difference]: Finished difference Result 526 states and 643 transitions. [2025-03-04 01:02:36,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:02:36,141 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:02:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:36,142 INFO L225 Difference]: With dead ends: 526 [2025-03-04 01:02:36,142 INFO L226 Difference]: Without dead ends: 370 [2025-03-04 01:02:36,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:02:36,144 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 89 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:36,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1766 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:02:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-04 01:02:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 361. [2025-03-04 01:02:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 298 states have (on average 1.1778523489932886) internal successors, (351), 299 states have internal predecessors, (351), 44 states have call successors, (44), 18 states have call predecessors, (44), 18 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:02:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 439 transitions. [2025-03-04 01:02:36,176 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 439 transitions. Word has length 129 [2025-03-04 01:02:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:36,177 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 439 transitions. [2025-03-04 01:02:36,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 439 transitions. [2025-03-04 01:02:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:36,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:36,178 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:36,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:02:36,178 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:36,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:36,178 INFO L85 PathProgramCache]: Analyzing trace with hash 697021963, now seen corresponding path program 1 times [2025-03-04 01:02:36,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:36,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297264727] [2025-03-04 01:02:36,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:36,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:36,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:36,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:36,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:36,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:36,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:36,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297264727] [2025-03-04 01:02:36,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297264727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:36,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:36,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:02:36,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795762168] [2025-03-04 01:02:36,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:36,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:02:36,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:36,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:02:36,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:02:36,496 INFO L87 Difference]: Start difference. First operand 361 states and 439 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:36,728 INFO L93 Difference]: Finished difference Result 814 states and 992 transitions. [2025-03-04 01:02:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:02:36,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2025-03-04 01:02:36,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:36,732 INFO L225 Difference]: With dead ends: 814 [2025-03-04 01:02:36,734 INFO L226 Difference]: Without dead ends: 537 [2025-03-04 01:02:36,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:02:36,736 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 63 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:36,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 736 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:02:36,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-04 01:02:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533. [2025-03-04 01:02:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 438 states have (on average 1.1757990867579908) internal successors, (515), 441 states have internal predecessors, (515), 64 states have call successors, (64), 30 states have call predecessors, (64), 30 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 01:02:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 643 transitions. [2025-03-04 01:02:36,782 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 643 transitions. Word has length 129 [2025-03-04 01:02:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:36,783 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 643 transitions. [2025-03-04 01:02:36,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 643 transitions. [2025-03-04 01:02:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:36,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:36,785 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:36,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:02:36,785 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:36,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:36,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1425239952, now seen corresponding path program 1 times [2025-03-04 01:02:36,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:36,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492792777] [2025-03-04 01:02:36,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:36,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:36,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:36,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:36,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:36,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:37,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:37,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492792777] [2025-03-04 01:02:37,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492792777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:37,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:37,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:02:37,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280059188] [2025-03-04 01:02:37,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:37,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:02:37,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:37,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:02:37,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:02:37,327 INFO L87 Difference]: Start difference. First operand 533 states and 643 transitions. Second operand has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:02:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:37,894 INFO L93 Difference]: Finished difference Result 1381 states and 1669 transitions. [2025-03-04 01:02:37,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:02:37,895 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-03-04 01:02:37,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:37,899 INFO L225 Difference]: With dead ends: 1381 [2025-03-04 01:02:37,899 INFO L226 Difference]: Without dead ends: 932 [2025-03-04 01:02:37,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:02:37,903 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 85 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:37,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1155 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:02:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-03-04 01:02:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 597. [2025-03-04 01:02:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 502 states have (on average 1.1932270916334662) internal successors, (599), 505 states have internal predecessors, (599), 64 states have call successors, (64), 30 states have call predecessors, (64), 30 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 01:02:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 727 transitions. [2025-03-04 01:02:37,966 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 727 transitions. Word has length 129 [2025-03-04 01:02:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:37,966 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 727 transitions. [2025-03-04 01:02:37,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:02:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 727 transitions. [2025-03-04 01:02:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:37,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:37,968 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:37,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:02:37,968 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:37,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:37,968 INFO L85 PathProgramCache]: Analyzing trace with hash 826104682, now seen corresponding path program 1 times [2025-03-04 01:02:37,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:37,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877772214] [2025-03-04 01:02:37,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:37,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:37,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:37,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:37,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:38,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:38,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877772214] [2025-03-04 01:02:38,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877772214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:38,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:38,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:02:38,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583859741] [2025-03-04 01:02:38,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:38,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:02:38,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:38,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:02:38,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:02:38,458 INFO L87 Difference]: Start difference. First operand 597 states and 727 transitions. Second operand has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:38,869 INFO L93 Difference]: Finished difference Result 1442 states and 1740 transitions. [2025-03-04 01:02:38,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:02:38,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:02:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:38,875 INFO L225 Difference]: With dead ends: 1442 [2025-03-04 01:02:38,875 INFO L226 Difference]: Without dead ends: 929 [2025-03-04 01:02:38,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:02:38,877 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 79 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:38,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 829 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:02:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-03-04 01:02:38,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 625. [2025-03-04 01:02:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 530 states have (on average 1.179245283018868) internal successors, (625), 533 states have internal predecessors, (625), 64 states have call successors, (64), 30 states have call predecessors, (64), 30 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 01:02:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 753 transitions. [2025-03-04 01:02:38,933 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 753 transitions. Word has length 129 [2025-03-04 01:02:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:38,934 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 753 transitions. [2025-03-04 01:02:38,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 753 transitions. [2025-03-04 01:02:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:38,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:38,936 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:38,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:02:38,936 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:38,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:38,937 INFO L85 PathProgramCache]: Analyzing trace with hash 826528715, now seen corresponding path program 1 times [2025-03-04 01:02:38,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:38,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262813771] [2025-03-04 01:02:38,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:38,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:38,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:38,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:38,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:38,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:39,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:39,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262813771] [2025-03-04 01:02:39,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262813771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:39,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:39,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:02:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142198109] [2025-03-04 01:02:39,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:39,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:02:39,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:39,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:02:39,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:02:39,050 INFO L87 Difference]: Start difference. First operand 625 states and 753 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:39,239 INFO L93 Difference]: Finished difference Result 1297 states and 1560 transitions. [2025-03-04 01:02:39,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:02:39,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-04 01:02:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:39,243 INFO L225 Difference]: With dead ends: 1297 [2025-03-04 01:02:39,243 INFO L226 Difference]: Without dead ends: 756 [2025-03-04 01:02:39,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:02:39,245 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 89 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:39,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 515 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:02:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-03-04 01:02:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 594. [2025-03-04 01:02:39,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 499 states have (on average 1.1783567134268538) internal successors, (588), 502 states have internal predecessors, (588), 64 states have call successors, (64), 30 states have call predecessors, (64), 30 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 01:02:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 716 transitions. [2025-03-04 01:02:39,319 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 716 transitions. Word has length 129 [2025-03-04 01:02:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:39,319 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 716 transitions. [2025-03-04 01:02:39,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 716 transitions. [2025-03-04 01:02:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:39,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:39,321 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:39,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:02:39,322 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:39,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:39,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1590696304, now seen corresponding path program 1 times [2025-03-04 01:02:39,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:39,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903021165] [2025-03-04 01:02:39,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:39,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:39,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:39,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:39,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:39,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:39,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:39,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903021165] [2025-03-04 01:02:39,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903021165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:39,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:39,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:02:39,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507667960] [2025-03-04 01:02:39,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:39,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:02:39,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:39,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:02:39,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:02:39,912 INFO L87 Difference]: Start difference. First operand 594 states and 716 transitions. Second operand has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:02:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:40,378 INFO L93 Difference]: Finished difference Result 1243 states and 1496 transitions. [2025-03-04 01:02:40,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:02:40,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-03-04 01:02:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:40,381 INFO L225 Difference]: With dead ends: 1243 [2025-03-04 01:02:40,381 INFO L226 Difference]: Without dead ends: 733 [2025-03-04 01:02:40,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:02:40,383 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 79 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:40,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 948 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:02:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-04 01:02:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 729. [2025-03-04 01:02:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 597 states have (on average 1.1658291457286432) internal successors, (696), 602 states have internal predecessors, (696), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-04 01:02:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 872 transitions. [2025-03-04 01:02:40,466 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 872 transitions. Word has length 129 [2025-03-04 01:02:40,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:40,467 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 872 transitions. [2025-03-04 01:02:40,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:02:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 872 transitions. [2025-03-04 01:02:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:40,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:40,469 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:40,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:02:40,469 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:40,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:40,470 INFO L85 PathProgramCache]: Analyzing trace with hash -728079116, now seen corresponding path program 1 times [2025-03-04 01:02:40,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:40,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849378687] [2025-03-04 01:02:40,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:40,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:40,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:40,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:40,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:40,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:41,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:41,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849378687] [2025-03-04 01:02:41,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849378687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:41,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:41,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-04 01:02:41,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455332298] [2025-03-04 01:02:42,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:42,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 01:02:42,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:42,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 01:02:42,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:02:42,002 INFO L87 Difference]: Start difference. First operand 729 states and 872 transitions. Second operand has 21 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 21 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 01:02:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:43,901 INFO L93 Difference]: Finished difference Result 1555 states and 1853 transitions. [2025-03-04 01:02:43,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 01:02:43,902 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 21 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) Word has length 129 [2025-03-04 01:02:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:43,908 INFO L225 Difference]: With dead ends: 1555 [2025-03-04 01:02:43,908 INFO L226 Difference]: Without dead ends: 959 [2025-03-04 01:02:43,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 01:02:43,910 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 165 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:43,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 2331 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:02:43,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-04 01:02:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 766. [2025-03-04 01:02:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 634 states have (on average 1.167192429022082) internal successors, (740), 639 states have internal predecessors, (740), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-04 01:02:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 916 transitions. [2025-03-04 01:02:44,009 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 916 transitions. Word has length 129 [2025-03-04 01:02:44,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:44,010 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 916 transitions. [2025-03-04 01:02:44,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 21 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 01:02:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 916 transitions. [2025-03-04 01:02:44,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:44,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:44,011 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:44,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:02:44,012 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:44,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:44,012 INFO L85 PathProgramCache]: Analyzing trace with hash -924592621, now seen corresponding path program 1 times [2025-03-04 01:02:44,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:44,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579648600] [2025-03-04 01:02:44,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:44,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:44,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:44,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:44,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:44,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:44,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:44,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579648600] [2025-03-04 01:02:44,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579648600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:44,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:44,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:02:44,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443147163] [2025-03-04 01:02:44,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:44,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:02:44,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:44,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:02:44,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:02:44,449 INFO L87 Difference]: Start difference. First operand 766 states and 916 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:44,829 INFO L93 Difference]: Finished difference Result 1474 states and 1764 transitions. [2025-03-04 01:02:44,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:02:44,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2025-03-04 01:02:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:44,833 INFO L225 Difference]: With dead ends: 1474 [2025-03-04 01:02:44,834 INFO L226 Difference]: Without dead ends: 841 [2025-03-04 01:02:44,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:02:44,835 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 62 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:44,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 738 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:02:44,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-03-04 01:02:44,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 766. [2025-03-04 01:02:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 634 states have (on average 1.1545741324921135) internal successors, (732), 639 states have internal predecessors, (732), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-04 01:02:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 908 transitions. [2025-03-04 01:02:44,927 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 908 transitions. Word has length 129 [2025-03-04 01:02:44,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:44,927 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 908 transitions. [2025-03-04 01:02:44,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:44,929 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 908 transitions. [2025-03-04 01:02:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:44,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:44,935 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:44,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:02:44,935 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:44,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:44,935 INFO L85 PathProgramCache]: Analyzing trace with hash -795085869, now seen corresponding path program 1 times [2025-03-04 01:02:44,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:44,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796993632] [2025-03-04 01:02:44,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:44,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:44,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:44,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:44,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:44,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:45,097 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:45,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:45,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796993632] [2025-03-04 01:02:45,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796993632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:45,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:45,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:02:45,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640303838] [2025-03-04 01:02:45,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:45,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:02:45,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:45,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:02:45,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:02:45,099 INFO L87 Difference]: Start difference. First operand 766 states and 908 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:45,306 INFO L93 Difference]: Finished difference Result 1362 states and 1619 transitions. [2025-03-04 01:02:45,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:02:45,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-04 01:02:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:45,309 INFO L225 Difference]: With dead ends: 1362 [2025-03-04 01:02:45,309 INFO L226 Difference]: Without dead ends: 729 [2025-03-04 01:02:45,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:02:45,311 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 86 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:45,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 525 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:02:45,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-04 01:02:45,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 727. [2025-03-04 01:02:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 595 states have (on average 1.1512605042016806) internal successors, (685), 600 states have internal predecessors, (685), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-04 01:02:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 861 transitions. [2025-03-04 01:02:45,421 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 861 transitions. Word has length 129 [2025-03-04 01:02:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:45,421 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 861 transitions. [2025-03-04 01:02:45,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 861 transitions. [2025-03-04 01:02:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:45,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:45,423 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:45,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:02:45,423 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:45,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:45,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1394220145, now seen corresponding path program 1 times [2025-03-04 01:02:45,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:45,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750594471] [2025-03-04 01:02:45,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:45,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:45,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:45,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:45,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:45,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:45,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:45,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750594471] [2025-03-04 01:02:45,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750594471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:45,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:45,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:02:45,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602107134] [2025-03-04 01:02:45,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:45,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:02:45,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:45,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:02:45,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:02:45,623 INFO L87 Difference]: Start difference. First operand 727 states and 861 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:45,762 INFO L93 Difference]: Finished difference Result 1110 states and 1318 transitions. [2025-03-04 01:02:45,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:02:45,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2025-03-04 01:02:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:45,764 INFO L225 Difference]: With dead ends: 1110 [2025-03-04 01:02:45,764 INFO L226 Difference]: Without dead ends: 516 [2025-03-04 01:02:45,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:02:45,766 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:45,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 481 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:02:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-04 01:02:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-04 01:02:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 418 states have (on average 1.138755980861244) internal successors, (476), 421 states have internal predecessors, (476), 66 states have call successors, (66), 31 states have call predecessors, (66), 31 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:02:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 608 transitions. [2025-03-04 01:02:45,817 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 608 transitions. Word has length 129 [2025-03-04 01:02:45,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:45,817 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 608 transitions. [2025-03-04 01:02:45,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 608 transitions. [2025-03-04 01:02:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:45,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:45,818 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:45,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:02:45,819 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:45,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:45,819 INFO L85 PathProgramCache]: Analyzing trace with hash 857548522, now seen corresponding path program 1 times [2025-03-04 01:02:45,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:45,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977456926] [2025-03-04 01:02:45,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:45,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:45,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:45,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:45,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:45,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:46,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977456926] [2025-03-04 01:02:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977456926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:46,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:02:46,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775578747] [2025-03-04 01:02:46,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:46,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:02:46,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:46,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:02:46,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:02:46,336 INFO L87 Difference]: Start difference. First operand 516 states and 608 transitions. Second operand has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:46,687 INFO L93 Difference]: Finished difference Result 894 states and 1053 transitions. [2025-03-04 01:02:46,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:02:46,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:02:46,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:46,693 INFO L225 Difference]: With dead ends: 894 [2025-03-04 01:02:46,694 INFO L226 Difference]: Without dead ends: 511 [2025-03-04 01:02:46,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:02:46,695 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 81 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:46,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 698 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:02:46,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-04 01:02:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 508. [2025-03-04 01:02:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 409 states have (on average 1.1271393643031784) internal successors, (461), 412 states have internal predecessors, (461), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:02:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 593 transitions. [2025-03-04 01:02:46,753 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 593 transitions. Word has length 129 [2025-03-04 01:02:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:46,753 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 593 transitions. [2025-03-04 01:02:46,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 593 transitions. [2025-03-04 01:02:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:46,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:46,754 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:46,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:02:46,754 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:46,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:46,755 INFO L85 PathProgramCache]: Analyzing trace with hash 986631241, now seen corresponding path program 1 times [2025-03-04 01:02:46,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:46,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466390410] [2025-03-04 01:02:46,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:46,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:46,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:46,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:46,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:46,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:46,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:46,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466390410] [2025-03-04 01:02:46,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466390410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:46,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:46,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:02:46,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963839369] [2025-03-04 01:02:46,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:46,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:02:46,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:46,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:02:46,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:02:46,949 INFO L87 Difference]: Start difference. First operand 508 states and 593 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:47,184 INFO L93 Difference]: Finished difference Result 946 states and 1107 transitions. [2025-03-04 01:02:47,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:02:47,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-04 01:02:47,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:47,187 INFO L225 Difference]: With dead ends: 946 [2025-03-04 01:02:47,187 INFO L226 Difference]: Without dead ends: 575 [2025-03-04 01:02:47,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:02:47,188 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 65 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:47,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 508 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:02:47,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-04 01:02:47,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 508. [2025-03-04 01:02:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 409 states have (on average 1.1222493887530562) internal successors, (459), 412 states have internal predecessors, (459), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:02:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 591 transitions. [2025-03-04 01:02:47,238 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 591 transitions. Word has length 129 [2025-03-04 01:02:47,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:47,238 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 591 transitions. [2025-03-04 01:02:47,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 591 transitions. [2025-03-04 01:02:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:47,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:47,239 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:47,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:02:47,240 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:47,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash 790117736, now seen corresponding path program 1 times [2025-03-04 01:02:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:47,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329055013] [2025-03-04 01:02:47,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:47,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:47,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:47,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:47,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:47,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:47,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329055013] [2025-03-04 01:02:47,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329055013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:47,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:47,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:02:47,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766763368] [2025-03-04 01:02:47,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:47,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:02:47,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:47,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:02:47,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:02:47,843 INFO L87 Difference]: Start difference. First operand 508 states and 591 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:48,413 INFO L93 Difference]: Finished difference Result 1008 states and 1178 transitions. [2025-03-04 01:02:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:02:48,414 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:02:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:48,416 INFO L225 Difference]: With dead ends: 1008 [2025-03-04 01:02:48,416 INFO L226 Difference]: Without dead ends: 637 [2025-03-04 01:02:48,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:02:48,417 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 79 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:48,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 2043 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:02:48,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-04 01:02:48,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 540. [2025-03-04 01:02:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 441 states have (on average 1.129251700680272) internal successors, (498), 444 states have internal predecessors, (498), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:02:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 630 transitions. [2025-03-04 01:02:48,480 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 630 transitions. Word has length 129 [2025-03-04 01:02:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:48,481 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 630 transitions. [2025-03-04 01:02:48,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 630 transitions. [2025-03-04 01:02:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:48,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:48,482 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:48,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:02:48,482 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:48,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:48,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1332144179, now seen corresponding path program 1 times [2025-03-04 01:02:48,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:48,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470644708] [2025-03-04 01:02:48,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:48,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:48,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:48,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:48,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:48,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:48,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:48,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470644708] [2025-03-04 01:02:48,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470644708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:48,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:48,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:02:48,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726645741] [2025-03-04 01:02:48,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:48,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:02:48,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:48,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:02:48,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:02:48,678 INFO L87 Difference]: Start difference. First operand 540 states and 630 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:48,901 INFO L93 Difference]: Finished difference Result 1016 states and 1187 transitions. [2025-03-04 01:02:48,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:02:48,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-04 01:02:48,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:48,907 INFO L225 Difference]: With dead ends: 1016 [2025-03-04 01:02:48,907 INFO L226 Difference]: Without dead ends: 613 [2025-03-04 01:02:48,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:02:48,907 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 64 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:48,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 508 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:02:48,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-03-04 01:02:48,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 540. [2025-03-04 01:02:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 441 states have (on average 1.124716553287982) internal successors, (496), 444 states have internal predecessors, (496), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:02:48,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 628 transitions. [2025-03-04 01:02:48,959 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 628 transitions. Word has length 129 [2025-03-04 01:02:48,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:48,960 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 628 transitions. [2025-03-04 01:02:48,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 628 transitions. [2025-03-04 01:02:48,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:48,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:48,961 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:48,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:02:48,961 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:48,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:48,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1528657684, now seen corresponding path program 1 times [2025-03-04 01:02:48,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:48,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607474369] [2025-03-04 01:02:48,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:48,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:48,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:48,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:48,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:48,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:49,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:49,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607474369] [2025-03-04 01:02:49,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607474369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:49,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:49,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:02:49,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653953476] [2025-03-04 01:02:49,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:49,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:02:49,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:49,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:02:49,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:02:49,394 INFO L87 Difference]: Start difference. First operand 540 states and 628 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:49,765 INFO L93 Difference]: Finished difference Result 1016 states and 1183 transitions. [2025-03-04 01:02:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:02:49,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:02:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:49,768 INFO L225 Difference]: With dead ends: 1016 [2025-03-04 01:02:49,768 INFO L226 Difference]: Without dead ends: 613 [2025-03-04 01:02:49,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:02:49,769 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 70 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:49,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1207 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:02:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-03-04 01:02:49,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 540. [2025-03-04 01:02:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 441 states have (on average 1.1201814058956916) internal successors, (494), 444 states have internal predecessors, (494), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:02:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 626 transitions. [2025-03-04 01:02:49,831 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 626 transitions. Word has length 129 [2025-03-04 01:02:49,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:49,832 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 626 transitions. [2025-03-04 01:02:49,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 626 transitions. [2025-03-04 01:02:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:49,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:49,833 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:49,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:02:49,834 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:49,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1554285325, now seen corresponding path program 1 times [2025-03-04 01:02:49,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:49,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418945431] [2025-03-04 01:02:49,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:49,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:49,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:49,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:49,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:49,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:50,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:50,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418945431] [2025-03-04 01:02:50,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418945431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:50,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:50,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:02:50,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711847902] [2025-03-04 01:02:50,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:50,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:02:50,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:50,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:02:50,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:02:50,282 INFO L87 Difference]: Start difference. First operand 540 states and 626 transitions. Second operand has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:50,564 INFO L93 Difference]: Finished difference Result 1041 states and 1209 transitions. [2025-03-04 01:02:50,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:02:50,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:02:50,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:50,567 INFO L225 Difference]: With dead ends: 1041 [2025-03-04 01:02:50,567 INFO L226 Difference]: Without dead ends: 636 [2025-03-04 01:02:50,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:02:50,568 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 76 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:50,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 863 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:02:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-04 01:02:50,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 563. [2025-03-04 01:02:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 464 states have (on average 1.1206896551724137) internal successors, (520), 467 states have internal predecessors, (520), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:02:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 652 transitions. [2025-03-04 01:02:50,653 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 652 transitions. Word has length 129 [2025-03-04 01:02:50,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:50,653 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 652 transitions. [2025-03-04 01:02:50,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 652 transitions. [2025-03-04 01:02:50,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:50,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:50,655 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:50,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:02:50,655 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:50,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:50,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1487278572, now seen corresponding path program 1 times [2025-03-04 01:02:50,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:50,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385382233] [2025-03-04 01:02:50,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:50,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:50,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:50,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:50,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:50,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:51,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385382233] [2025-03-04 01:02:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385382233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:51,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:51,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:02:51,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365973210] [2025-03-04 01:02:51,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:51,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:02:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:51,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:02:51,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:02:51,116 INFO L87 Difference]: Start difference. First operand 563 states and 652 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:51,560 INFO L93 Difference]: Finished difference Result 1058 states and 1227 transitions. [2025-03-04 01:02:51,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:02:51,562 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:02:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:51,565 INFO L225 Difference]: With dead ends: 1058 [2025-03-04 01:02:51,565 INFO L226 Difference]: Without dead ends: 632 [2025-03-04 01:02:51,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:02:51,566 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 74 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:51,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 874 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:02:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-04 01:02:51,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 559. [2025-03-04 01:02:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 460 states have (on average 1.117391304347826) internal successors, (514), 463 states have internal predecessors, (514), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:02:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 646 transitions. [2025-03-04 01:02:51,625 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 646 transitions. Word has length 129 [2025-03-04 01:02:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:51,626 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 646 transitions. [2025-03-04 01:02:51,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 646 transitions. [2025-03-04 01:02:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:02:51,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:51,627 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:51,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:02:51,627 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:51,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash -831496848, now seen corresponding path program 1 times [2025-03-04 01:02:51,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:51,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501186887] [2025-03-04 01:02:51,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:51,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:51,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:02:51,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:02:51,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:51,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:52,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:52,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501186887] [2025-03-04 01:02:52,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501186887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:52,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:52,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:02:52,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824829415] [2025-03-04 01:02:52,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:52,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:02:52,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:52,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:02:52,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:02:52,299 INFO L87 Difference]: Start difference. First operand 559 states and 646 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:52,885 INFO L93 Difference]: Finished difference Result 1066 states and 1231 transitions. [2025-03-04 01:02:52,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:02:52,885 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:02:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:52,888 INFO L225 Difference]: With dead ends: 1066 [2025-03-04 01:02:52,888 INFO L226 Difference]: Without dead ends: 644 [2025-03-04 01:02:52,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:02:52,889 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 70 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:52,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 2131 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:02:52,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-03-04 01:02:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 551. [2025-03-04 01:02:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 452 states have (on average 1.1150442477876106) internal successors, (504), 455 states have internal predecessors, (504), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:02:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 636 transitions. [2025-03-04 01:02:52,952 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 636 transitions. Word has length 129 [2025-03-04 01:02:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:52,952 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 636 transitions. [2025-03-04 01:02:52,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:02:52,953 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 636 transitions. [2025-03-04 01:02:52,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:02:52,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:52,953 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:52,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:02:52,954 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:52,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:52,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1746639435, now seen corresponding path program 1 times [2025-03-04 01:02:52,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:52,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034669598] [2025-03-04 01:02:52,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:52,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:52,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:02:52,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:02:52,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:52,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:53,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:53,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034669598] [2025-03-04 01:02:53,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034669598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:53,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:53,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:02:53,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024482781] [2025-03-04 01:02:53,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:53,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:02:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:53,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:02:53,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:02:53,023 INFO L87 Difference]: Start difference. First operand 551 states and 636 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:53,125 INFO L93 Difference]: Finished difference Result 967 states and 1118 transitions. [2025-03-04 01:02:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:02:53,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-04 01:02:53,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:53,128 INFO L225 Difference]: With dead ends: 967 [2025-03-04 01:02:53,128 INFO L226 Difference]: Without dead ends: 530 [2025-03-04 01:02:53,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:02:53,129 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 66 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:53,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 465 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-04 01:02:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2025-03-04 01:02:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 429 states have (on average 1.0932400932400932) internal successors, (469), 432 states have internal predecessors, (469), 66 states have call successors, (66), 32 states have call predecessors, (66), 32 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:02:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 601 transitions. [2025-03-04 01:02:53,192 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 601 transitions. Word has length 131 [2025-03-04 01:02:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:53,192 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 601 transitions. [2025-03-04 01:02:53,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 601 transitions. [2025-03-04 01:02:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:02:53,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:53,193 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:53,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:02:53,193 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:53,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:53,193 INFO L85 PathProgramCache]: Analyzing trace with hash 621306219, now seen corresponding path program 1 times [2025-03-04 01:02:53,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:53,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976229216] [2025-03-04 01:02:53,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:53,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:53,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:02:53,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:02:53,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:53,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-04 01:02:53,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:53,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976229216] [2025-03-04 01:02:53,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976229216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:53,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152934552] [2025-03-04 01:02:53,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:53,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:53,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:53,618 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:53,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 01:02:53,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:02:53,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:02:53,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:53,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:53,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 01:02:53,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:53,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 01:02:53,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-04 01:02:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 149 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:02:54,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:02:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-03-04 01:02:54,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152934552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:02:54,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:02:54,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 28 [2025-03-04 01:02:54,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017598260] [2025-03-04 01:02:54,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:02:54,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 01:02:54,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:54,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 01:02:54,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:02:54,385 INFO L87 Difference]: Start difference. First operand 528 states and 601 transitions. Second operand has 28 states, 22 states have (on average 4.863636363636363) internal successors, (107), 26 states have internal predecessors, (107), 11 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 11 states have call successors, (35) [2025-03-04 01:02:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:55,085 INFO L93 Difference]: Finished difference Result 925 states and 1046 transitions. [2025-03-04 01:02:55,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:02:55,086 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 4.863636363636363) internal successors, (107), 26 states have internal predecessors, (107), 11 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 11 states have call successors, (35) Word has length 136 [2025-03-04 01:02:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:55,088 INFO L225 Difference]: With dead ends: 925 [2025-03-04 01:02:55,088 INFO L226 Difference]: Without dead ends: 534 [2025-03-04 01:02:55,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=359, Invalid=1447, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 01:02:55,090 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 459 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:55,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 570 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:02:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-04 01:02:55,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 512. [2025-03-04 01:02:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 409 states have (on average 1.0880195599022005) internal successors, (445), 412 states have internal predecessors, (445), 66 states have call successors, (66), 36 states have call predecessors, (66), 36 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:02:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 577 transitions. [2025-03-04 01:02:55,150 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 577 transitions. Word has length 136 [2025-03-04 01:02:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:55,151 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 577 transitions. [2025-03-04 01:02:55,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 4.863636363636363) internal successors, (107), 26 states have internal predecessors, (107), 11 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 11 states have call successors, (35) [2025-03-04 01:02:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 577 transitions. [2025-03-04 01:02:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:02:55,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:55,151 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:55,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 01:02:55,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-04 01:02:55,352 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:55,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:55,352 INFO L85 PathProgramCache]: Analyzing trace with hash -930829589, now seen corresponding path program 1 times [2025-03-04 01:02:55,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:55,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075726554] [2025-03-04 01:02:55,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:55,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:55,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:02:55,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:02:55,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:55,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:02:55,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1592970006] [2025-03-04 01:02:55,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:55,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:55,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:55,406 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:55,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 01:02:55,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:02:55,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:02:55,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:55,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:55,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 01:02:55,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:55,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:02:55,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:02:55,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:02:55,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:55,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 29 [2025-03-04 01:02:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:55,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:55,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:55,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075726554] [2025-03-04 01:02:55,953 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:02:55,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592970006] [2025-03-04 01:02:55,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592970006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:55,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:55,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:02:55,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640549980] [2025-03-04 01:02:55,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:55,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:02:55,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:55,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:02:55,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:02:55,954 INFO L87 Difference]: Start difference. First operand 512 states and 577 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:56,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:56,240 INFO L93 Difference]: Finished difference Result 974 states and 1099 transitions. [2025-03-04 01:02:56,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:02:56,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-03-04 01:02:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:56,243 INFO L225 Difference]: With dead ends: 974 [2025-03-04 01:02:56,243 INFO L226 Difference]: Without dead ends: 607 [2025-03-04 01:02:56,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:02:56,244 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 98 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:56,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 377 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:02:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-04 01:02:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 520. [2025-03-04 01:02:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 417 states have (on average 1.091127098321343) internal successors, (455), 420 states have internal predecessors, (455), 66 states have call successors, (66), 36 states have call predecessors, (66), 36 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:02:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 587 transitions. [2025-03-04 01:02:56,307 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 587 transitions. Word has length 136 [2025-03-04 01:02:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:56,307 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 587 transitions. [2025-03-04 01:02:56,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 587 transitions. [2025-03-04 01:02:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:02:56,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:56,308 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:56,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 01:02:56,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-04 01:02:56,508 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:56,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:56,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1588046677, now seen corresponding path program 1 times [2025-03-04 01:02:56,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:56,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092005137] [2025-03-04 01:02:56,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:56,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:56,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:02:56,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:02:56,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:56,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-04 01:02:56,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:56,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092005137] [2025-03-04 01:02:56,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092005137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:56,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278658755] [2025-03-04 01:02:56,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:56,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:56,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:56,954 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:56,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 01:02:57,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:02:57,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:02:57,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:57,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:57,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 01:02:57,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:57,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:02:57,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:02:57,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:57,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-04 01:02:57,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:57,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-04 01:02:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 231 proven. 12 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-03-04 01:02:57,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:02:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-03-04 01:02:57,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278658755] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:02:57,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:02:57,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29 [2025-03-04 01:02:57,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565082156] [2025-03-04 01:02:57,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:02:57,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 01:02:57,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:57,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 01:02:57,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:02:57,790 INFO L87 Difference]: Start difference. First operand 520 states and 587 transitions. Second operand has 29 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 29 states have internal predecessors, (148), 13 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 13 states have call successors, (37) [2025-03-04 01:02:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:58,529 INFO L93 Difference]: Finished difference Result 885 states and 996 transitions. [2025-03-04 01:02:58,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 01:02:58,530 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 29 states have internal predecessors, (148), 13 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 13 states have call successors, (37) Word has length 136 [2025-03-04 01:02:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:58,532 INFO L225 Difference]: With dead ends: 885 [2025-03-04 01:02:58,532 INFO L226 Difference]: Without dead ends: 518 [2025-03-04 01:02:58,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 258 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=396, Invalid=1674, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 01:02:58,533 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 314 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:58,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 608 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:02:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-04 01:02:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 406. [2025-03-04 01:02:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 323 states have (on average 1.0866873065015479) internal successors, (351), 325 states have internal predecessors, (351), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:02:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 455 transitions. [2025-03-04 01:02:58,589 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 455 transitions. Word has length 136 [2025-03-04 01:02:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:58,589 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 455 transitions. [2025-03-04 01:02:58,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 29 states have internal predecessors, (148), 13 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 13 states have call successors, (37) [2025-03-04 01:02:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 455 transitions. [2025-03-04 01:02:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:02:58,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:58,590 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:58,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 01:02:58,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 01:02:58,791 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:58,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:58,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1154784811, now seen corresponding path program 1 times [2025-03-04 01:02:58,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:58,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917478699] [2025-03-04 01:02:58,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:58,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:58,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:02:58,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:02:58,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:58,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:02:58,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103274079] [2025-03-04 01:02:58,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:58,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:58,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:58,852 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:58,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 01:02:58,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:02:59,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:02:59,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:59,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:59,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 01:02:59,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:59,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 01:02:59,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:02:59,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:02:59,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:02:59,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:59,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 26 [2025-03-04 01:02:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:59,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:59,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:59,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917478699] [2025-03-04 01:02:59,321 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:02:59,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103274079] [2025-03-04 01:02:59,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103274079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:59,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:59,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:02:59,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88572790] [2025-03-04 01:02:59,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:59,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:02:59,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:59,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:02:59,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:02:59,325 INFO L87 Difference]: Start difference. First operand 406 states and 455 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:59,610 INFO L93 Difference]: Finished difference Result 990 states and 1104 transitions. [2025-03-04 01:02:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:02:59,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-03-04 01:02:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:59,613 INFO L225 Difference]: With dead ends: 990 [2025-03-04 01:02:59,613 INFO L226 Difference]: Without dead ends: 632 [2025-03-04 01:02:59,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:02:59,614 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 56 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:59,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 524 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:02:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-04 01:02:59,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 452. [2025-03-04 01:02:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 369 states have (on average 1.067750677506775) internal successors, (394), 371 states have internal predecessors, (394), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:02:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 498 transitions. [2025-03-04 01:02:59,668 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 498 transitions. Word has length 136 [2025-03-04 01:02:59,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:59,669 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 498 transitions. [2025-03-04 01:02:59,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:59,669 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 498 transitions. [2025-03-04 01:02:59,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:02:59,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:59,669 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:59,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 01:02:59,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-04 01:02:59,870 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:59,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:59,870 INFO L85 PathProgramCache]: Analyzing trace with hash 80077613, now seen corresponding path program 1 times [2025-03-04 01:02:59,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:59,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901114169] [2025-03-04 01:02:59,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:59,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:02:59,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:02:59,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:59,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:02:59,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698315711] [2025-03-04 01:02:59,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:59,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:59,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:59,938 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:59,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 01:03:00,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:03:00,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:03:00,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:00,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:00,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 01:03:00,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:00,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:00,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2025-03-04 01:03:00,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:00,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2025-03-04 01:03:00,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:03:00,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:00,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 29 [2025-03-04 01:03:00,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:00,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 35 [2025-03-04 01:03:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-04 01:03:00,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:03:01,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:01,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901114169] [2025-03-04 01:03:01,076 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:03:01,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698315711] [2025-03-04 01:03:01,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698315711] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:01,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:03:01,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2025-03-04 01:03:01,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930005948] [2025-03-04 01:03:01,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:01,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:03:01,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:01,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:03:01,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:03:01,077 INFO L87 Difference]: Start difference. First operand 452 states and 498 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:03:01,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:01,875 INFO L93 Difference]: Finished difference Result 864 states and 951 transitions. [2025-03-04 01:03:01,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:03:01,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2025-03-04 01:03:01,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:01,879 INFO L225 Difference]: With dead ends: 864 [2025-03-04 01:03:01,879 INFO L226 Difference]: Without dead ends: 579 [2025-03-04 01:03:01,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:03:01,880 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 219 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:01,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 486 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:03:01,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-04 01:03:01,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 472. [2025-03-04 01:03:01,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 389 states have (on average 1.0668380462724936) internal successors, (415), 391 states have internal predecessors, (415), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:03:01,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 519 transitions. [2025-03-04 01:03:01,943 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 519 transitions. Word has length 137 [2025-03-04 01:03:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:01,944 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 519 transitions. [2025-03-04 01:03:01,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:03:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 519 transitions. [2025-03-04 01:03:01,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:03:01,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:01,945 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:01,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 01:03:02,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:02,145 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:02,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1984536489, now seen corresponding path program 1 times [2025-03-04 01:03:02,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:02,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41548445] [2025-03-04 01:03:02,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:02,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:03:02,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:03:02,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:02,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:03:02,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819648954] [2025-03-04 01:03:02,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:02,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:02,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:02,198 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:03:02,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 01:03:02,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:03:02,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:03:02,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:02,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:02,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 01:03:02,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:02,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 01:03:02,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:03:02,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:03:02,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:03:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:03:02,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:02,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:02,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41548445] [2025-03-04 01:03:02,561 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:03:02,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819648954] [2025-03-04 01:03:02,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819648954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:02,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:02,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:03:02,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987449149] [2025-03-04 01:03:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:02,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:03:02,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:02,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:03:02,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:03:02,562 INFO L87 Difference]: Start difference. First operand 472 states and 519 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:03:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:02,845 INFO L93 Difference]: Finished difference Result 1033 states and 1130 transitions. [2025-03-04 01:03:02,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:03:02,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2025-03-04 01:03:02,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:02,848 INFO L225 Difference]: With dead ends: 1033 [2025-03-04 01:03:02,848 INFO L226 Difference]: Without dead ends: 564 [2025-03-04 01:03:02,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:03:02,849 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 45 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:02,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 269 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:03:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-04 01:03:02,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 357. [2025-03-04 01:03:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 304 states have (on average 1.0625) internal successors, (323), 304 states have internal predecessors, (323), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:03:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 387 transitions. [2025-03-04 01:03:02,900 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 387 transitions. Word has length 137 [2025-03-04 01:03:02,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:02,901 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 387 transitions. [2025-03-04 01:03:02,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:03:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 387 transitions. [2025-03-04 01:03:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 01:03:02,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:02,901 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:02,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 01:03:03,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:03,102 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:03,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash -637466220, now seen corresponding path program 1 times [2025-03-04 01:03:03,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:03,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37517850] [2025-03-04 01:03:03,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:03,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:03,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:03:03,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:03:03,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:03,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:03:03,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75168782] [2025-03-04 01:03:03,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:03,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:03,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:03,180 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:03:03,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 01:03:03,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:03:03,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:03:03,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:03,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:03,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:03:03,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:03,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:03:03,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:03:03,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:03:03,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:03:03,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:03,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 28 [2025-03-04 01:03:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:03:03,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:03,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:03,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37517850] [2025-03-04 01:03:03,535 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:03:03,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75168782] [2025-03-04 01:03:03,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75168782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:03,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:03,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:03:03,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37011799] [2025-03-04 01:03:03,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:03,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:03:03,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:03,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:03:03,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:03,536 INFO L87 Difference]: Start difference. First operand 357 states and 387 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:03:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:03,789 INFO L93 Difference]: Finished difference Result 653 states and 708 transitions. [2025-03-04 01:03:03,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:03:03,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2025-03-04 01:03:03,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:03,792 INFO L225 Difference]: With dead ends: 653 [2025-03-04 01:03:03,792 INFO L226 Difference]: Without dead ends: 394 [2025-03-04 01:03:03,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:03:03,792 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 56 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:03,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 514 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:03:03,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-04 01:03:03,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 328. [2025-03-04 01:03:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 275 states have (on average 1.050909090909091) internal successors, (289), 275 states have internal predecessors, (289), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:03:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 353 transitions. [2025-03-04 01:03:03,848 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 353 transitions. Word has length 138 [2025-03-04 01:03:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:03,848 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 353 transitions. [2025-03-04 01:03:03,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:03:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 353 transitions. [2025-03-04 01:03:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 01:03:03,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:03,855 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:03,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 01:03:04,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 01:03:04,056 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:04,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:04,056 INFO L85 PathProgramCache]: Analyzing trace with hash -252583860, now seen corresponding path program 1 times [2025-03-04 01:03:04,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:04,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415908611] [2025-03-04 01:03:04,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:04,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:04,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:03:04,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:03:04,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:04,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:03:04,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1680523891] [2025-03-04 01:03:04,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:04,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:04,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:04,124 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:03:04,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 01:03:04,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:03:04,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:03:04,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:04,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:04,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 01:03:04,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:04,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 01:03:04,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:03:04,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:03:04,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:03:04,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:04,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 28 [2025-03-04 01:03:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:03:04,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:04,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:04,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415908611] [2025-03-04 01:03:04,492 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:03:04,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680523891] [2025-03-04 01:03:04,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680523891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:04,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:04,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:03:04,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001349256] [2025-03-04 01:03:04,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:04,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:03:04,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:04,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:03:04,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:04,493 INFO L87 Difference]: Start difference. First operand 328 states and 353 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:03:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:04,751 INFO L93 Difference]: Finished difference Result 647 states and 697 transitions. [2025-03-04 01:03:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:03:04,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2025-03-04 01:03:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:04,754 INFO L225 Difference]: With dead ends: 647 [2025-03-04 01:03:04,754 INFO L226 Difference]: Without dead ends: 430 [2025-03-04 01:03:04,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:03:04,754 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:04,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 384 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:03:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-04 01:03:04,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 321. [2025-03-04 01:03:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 268 states have (on average 1.0485074626865671) internal successors, (281), 268 states have internal predecessors, (281), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:03:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 345 transitions. [2025-03-04 01:03:04,815 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 345 transitions. Word has length 138 [2025-03-04 01:03:04,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:04,815 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 345 transitions. [2025-03-04 01:03:04,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:03:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 345 transitions. [2025-03-04 01:03:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:03:04,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:04,816 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:04,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 01:03:05,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 01:03:05,017 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:05,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:05,017 INFO L85 PathProgramCache]: Analyzing trace with hash -480477584, now seen corresponding path program 1 times [2025-03-04 01:03:05,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:05,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869071060] [2025-03-04 01:03:05,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:05,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:05,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:03:05,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:03:05,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:05,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:03:05,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:05,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869071060] [2025-03-04 01:03:05,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869071060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:05,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:05,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:03:05,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878374751] [2025-03-04 01:03:05,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:05,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:03:05,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:05,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:03:05,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:03:05,866 INFO L87 Difference]: Start difference. First operand 321 states and 345 transitions. Second operand has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:03:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:06,262 INFO L93 Difference]: Finished difference Result 374 states and 399 transitions. [2025-03-04 01:03:06,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:03:06,263 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2025-03-04 01:03:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:06,265 INFO L225 Difference]: With dead ends: 374 [2025-03-04 01:03:06,265 INFO L226 Difference]: Without dead ends: 372 [2025-03-04 01:03:06,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:03:06,265 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 29 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:06,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1421 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:03:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-04 01:03:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 353. [2025-03-04 01:03:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 300 states have (on average 1.0466666666666666) internal successors, (314), 300 states have internal predecessors, (314), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:03:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 378 transitions. [2025-03-04 01:03:06,322 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 378 transitions. Word has length 142 [2025-03-04 01:03:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:06,322 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 378 transitions. [2025-03-04 01:03:06,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:03:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 378 transitions. [2025-03-04 01:03:06,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:03:06,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:06,323 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:06,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 01:03:06,323 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:06,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:06,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2007035249, now seen corresponding path program 1 times [2025-03-04 01:03:06,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:06,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357041721] [2025-03-04 01:03:06,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:06,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:06,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:03:06,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:03:06,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:06,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:03:06,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:06,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357041721] [2025-03-04 01:03:06,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357041721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:06,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:06,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:03:06,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280357687] [2025-03-04 01:03:06,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:06,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:03:06,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:06,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:03:06,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:03:06,673 INFO L87 Difference]: Start difference. First operand 353 states and 378 transitions. Second operand has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:03:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:06,830 INFO L93 Difference]: Finished difference Result 629 states and 671 transitions. [2025-03-04 01:03:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:03:06,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 142 [2025-03-04 01:03:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:06,833 INFO L225 Difference]: With dead ends: 629 [2025-03-04 01:03:06,833 INFO L226 Difference]: Without dead ends: 387 [2025-03-04 01:03:06,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:03:06,833 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 23 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:06,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 618 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:03:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-04 01:03:06,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 353. [2025-03-04 01:03:06,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 300 states have (on average 1.0433333333333332) internal successors, (313), 300 states have internal predecessors, (313), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:03:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 377 transitions. [2025-03-04 01:03:06,891 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 377 transitions. Word has length 142 [2025-03-04 01:03:06,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:06,891 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 377 transitions. [2025-03-04 01:03:06,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:03:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 377 transitions. [2025-03-04 01:03:06,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:03:06,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:06,892 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:06,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-04 01:03:06,892 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:06,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:06,892 INFO L85 PathProgramCache]: Analyzing trace with hash -469161457, now seen corresponding path program 1 times [2025-03-04 01:03:06,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:06,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901925282] [2025-03-04 01:03:06,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:06,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:06,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:03:06,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:03:06,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:06,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:03:07,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:07,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901925282] [2025-03-04 01:03:07,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901925282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:07,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:07,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:03:07,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243007313] [2025-03-04 01:03:07,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:07,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:03:07,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:07,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:03:07,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:07,204 INFO L87 Difference]: Start difference. First operand 353 states and 377 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:03:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:07,338 INFO L93 Difference]: Finished difference Result 610 states and 650 transitions. [2025-03-04 01:03:07,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:03:07,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2025-03-04 01:03:07,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:07,341 INFO L225 Difference]: With dead ends: 610 [2025-03-04 01:03:07,341 INFO L226 Difference]: Without dead ends: 368 [2025-03-04 01:03:07,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:03:07,342 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 41 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:07,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 472 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:03:07,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-04 01:03:07,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 353. [2025-03-04 01:03:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 300 states have (on average 1.04) internal successors, (312), 300 states have internal predecessors, (312), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:03:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 376 transitions. [2025-03-04 01:03:07,399 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 376 transitions. Word has length 142 [2025-03-04 01:03:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:07,399 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 376 transitions. [2025-03-04 01:03:07,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:03:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 376 transitions. [2025-03-04 01:03:07,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:03:07,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:07,400 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:07,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-04 01:03:07,400 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:07,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:07,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2018351376, now seen corresponding path program 1 times [2025-03-04 01:03:07,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:07,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813270277] [2025-03-04 01:03:07,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:07,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:07,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:03:07,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:03:07,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:07,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:03:07,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:07,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813270277] [2025-03-04 01:03:07,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813270277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:07,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:07,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:03:07,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965172814] [2025-03-04 01:03:07,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:07,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:03:07,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:07,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:03:07,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:03:07,747 INFO L87 Difference]: Start difference. First operand 353 states and 376 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:03:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:08,026 INFO L93 Difference]: Finished difference Result 460 states and 498 transitions. [2025-03-04 01:03:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:03:08,026 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 142 [2025-03-04 01:03:08,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:08,027 INFO L225 Difference]: With dead ends: 460 [2025-03-04 01:03:08,027 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 01:03:08,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:03:08,028 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 80 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:08,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1904 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:03:08,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 01:03:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 01:03:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 01:03:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 01:03:08,029 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2025-03-04 01:03:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:08,029 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 01:03:08,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:03:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 01:03:08,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 01:03:08,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:03:08,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-04 01:03:08,033 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:08,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.