./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.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 660f06fd7b788e8c10cf619684bc86bfa7277339b3513d64ca91be95bd68ab85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:49:36,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:49:36,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:49:36,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:49:36,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:49:36,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:49:36,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:49:36,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:49:36,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:49:36,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:49:36,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:49:36,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:49:36,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:49:36,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:49:36,695 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:49:36,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:49:36,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:49:36,695 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:49:36,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:49:36,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:49:36,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:49:36,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:49:36,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:49:36,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:49:36,696 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:49:36,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:49:36,696 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:49:36,696 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:49:36,696 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:49:36,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:49:36,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:49:36,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:49:36,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:49:36,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:49:36,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:49:36,697 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:49:36,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:49:36,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:49:36,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:49:36,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:49:36,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:49:36,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:49:36,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:49:36,698 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 -> 660f06fd7b788e8c10cf619684bc86bfa7277339b3513d64ca91be95bd68ab85 [2025-03-17 05:49:36,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:49:36,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:49:36,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:49:36,932 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:49:36,932 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:49:36,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i [2025-03-17 05:49:38,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccf69ba9/f5faec0f203943808e151437e9b40f46/FLAG244dd9ddd [2025-03-17 05:49:38,273 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:49:38,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i [2025-03-17 05:49:38,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccf69ba9/f5faec0f203943808e151437e9b40f46/FLAG244dd9ddd [2025-03-17 05:49:38,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccf69ba9/f5faec0f203943808e151437e9b40f46 [2025-03-17 05:49:38,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:49:38,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:49:38,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:49:38,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:49:38,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:49:38,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:49:38" (1/1) ... [2025-03-17 05:49:38,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e418488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38, skipping insertion in model container [2025-03-17 05:49:38,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:49:38" (1/1) ... [2025-03-17 05:49:38,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:49:38,746 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-p_file-71.i[916,929] [2025-03-17 05:49:38,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:49:38,815 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:49:38,824 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-p_file-71.i[916,929] [2025-03-17 05:49:38,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:49:38,871 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:49:38,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38 WrapperNode [2025-03-17 05:49:38,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:49:38,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:49:38,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:49:38,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:49:38,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38" (1/1) ... [2025-03-17 05:49:38,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38" (1/1) ... [2025-03-17 05:49:38,928 INFO L138 Inliner]: procedures = 26, calls = 182, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2025-03-17 05:49:38,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:49:38,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:49:38,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:49:38,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:49:38,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38" (1/1) ... [2025-03-17 05:49:38,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38" (1/1) ... [2025-03-17 05:49:38,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38" (1/1) ... [2025-03-17 05:49:38,967 INFO L175 MemorySlicer]: Split 138 memory accesses to 15 slices as follows [2, 11, 6, 22, 22, 22, 6, 8, 5, 3, 8, 7, 3, 6, 7]. 16 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 4, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2025-03-17 05:49:38,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38" (1/1) ... [2025-03-17 05:49:38,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38" (1/1) ... [2025-03-17 05:49:38,984 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38" (1/1) ... [2025-03-17 05:49:38,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38" (1/1) ... [2025-03-17 05:49:38,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38" (1/1) ... [2025-03-17 05:49:38,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38" (1/1) ... [2025-03-17 05:49:38,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:49:38,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:49:38,992 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:49:38,992 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:49:38,992 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38" (1/1) ... [2025-03-17 05:49:38,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:49:39,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:49:39,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:49:39,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:49:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:49:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:49:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:49:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:49:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:49:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:49:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:49:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:49:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:49:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:49:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:49:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:49:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:49:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 05:49:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 05:49:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-17 05:49:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:49:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:49:39,037 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:49:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-17 05:49:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:49:39,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:49:39,172 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:49:39,173 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:49:39,620 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~mem75#1;havoc property_#t~ite103#1;havoc property_#t~mem89#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite88#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem87#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~short92#1;havoc property_#t~ite102#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~mem122#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite121#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite130#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1; [2025-03-17 05:49:39,662 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-17 05:49:39,662 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:49:39,673 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:49:39,674 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:49:39,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:49:39 BoogieIcfgContainer [2025-03-17 05:49:39,674 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:49:39,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:49:39,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:49:39,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:49:39,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:49:38" (1/3) ... [2025-03-17 05:49:39,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75995f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:49:39, skipping insertion in model container [2025-03-17 05:49:39,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:38" (2/3) ... [2025-03-17 05:49:39,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75995f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:49:39, skipping insertion in model container [2025-03-17 05:49:39,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:49:39" (3/3) ... [2025-03-17 05:49:39,683 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-71.i [2025-03-17 05:49:39,695 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:49:39,698 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-71.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:49:39,737 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:49:39,747 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;@4dce17d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:49:39,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:49:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:49:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:49:39,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:39,763 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:39,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:39,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:39,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1265574784, now seen corresponding path program 1 times [2025-03-17 05:49:39,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:39,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610502874] [2025-03-17 05:49:39,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:39,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:49:39,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:49:39,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:39,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:49:40,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:40,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610502874] [2025-03-17 05:49:40,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610502874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:49:40,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166840138] [2025-03-17 05:49:40,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:40,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:49:40,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:49:40,044 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:49:40,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:49:40,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:49:40,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:49:40,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:40,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:40,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:49:40,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:49:40,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:40,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166840138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:40,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:49:40,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:49:40,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161913204] [2025-03-17 05:49:40,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:40,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:49:40,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:40,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:49:40,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:49:40,340 INFO L87 Difference]: Start difference. First operand has 99 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:49:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:40,363 INFO L93 Difference]: Finished difference Result 195 states and 309 transitions. [2025-03-17 05:49:40,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:49:40,365 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 140 [2025-03-17 05:49:40,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:40,370 INFO L225 Difference]: With dead ends: 195 [2025-03-17 05:49:40,370 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 05:49:40,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:49:40,374 INFO L435 NwaCegarLoop]: 140 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, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:40,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 05:49:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 05:49:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:49:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2025-03-17 05:49:40,409 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 140 [2025-03-17 05:49:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:40,410 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2025-03-17 05:49:40,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:49:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2025-03-17 05:49:40,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:49:40,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:40,413 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:40,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:49:40,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:49:40,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:40,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:40,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1041535795, now seen corresponding path program 1 times [2025-03-17 05:49:40,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:40,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659852069] [2025-03-17 05:49:40,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:40,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:40,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:49:40,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:49:40,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:40,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:40,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:40,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659852069] [2025-03-17 05:49:40,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659852069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:40,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:40,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:49:40,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172760319] [2025-03-17 05:49:40,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:40,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:49:40,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:40,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:49:40,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:40,897 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:40,937 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2025-03-17 05:49:40,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:40,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2025-03-17 05:49:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:40,939 INFO L225 Difference]: With dead ends: 196 [2025-03-17 05:49:40,939 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 05:49:40,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:40,940 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:40,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:40,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 05:49:40,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-17 05:49:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 78 states have internal predecessors, (104), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:49:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 142 transitions. [2025-03-17 05:49:40,948 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 142 transitions. Word has length 140 [2025-03-17 05:49:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:40,949 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 142 transitions. [2025-03-17 05:49:40,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 142 transitions. [2025-03-17 05:49:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:49:40,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:40,951 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:40,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:49:40,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:40,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash -154032114, now seen corresponding path program 1 times [2025-03-17 05:49:40,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:40,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298096776] [2025-03-17 05:49:40,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:40,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:49:40,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:49:41,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:41,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:41,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:41,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298096776] [2025-03-17 05:49:41,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298096776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:41,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:41,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:49:41,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113670963] [2025-03-17 05:49:41,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:41,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:49:41,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:41,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:49:41,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:41,181 INFO L87 Difference]: Start difference. First operand 99 states and 142 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:41,217 INFO L93 Difference]: Finished difference Result 200 states and 287 transitions. [2025-03-17 05:49:41,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:41,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2025-03-17 05:49:41,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:41,219 INFO L225 Difference]: With dead ends: 200 [2025-03-17 05:49:41,221 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 05:49:41,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:41,224 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:41,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 403 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 05:49:41,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 05:49:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:49:41,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-03-17 05:49:41,236 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 140 [2025-03-17 05:49:41,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:41,236 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-03-17 05:49:41,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:41,236 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-03-17 05:49:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:49:41,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:41,239 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:41,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:49:41,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:41,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:41,240 INFO L85 PathProgramCache]: Analyzing trace with hash -153108593, now seen corresponding path program 1 times [2025-03-17 05:49:41,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:41,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639177132] [2025-03-17 05:49:41,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:41,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:41,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:49:41,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:49:41,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:41,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:41,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639177132] [2025-03-17 05:49:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639177132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:41,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:41,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037198156] [2025-03-17 05:49:41,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:41,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:41,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:41,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:41,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:41,598 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:41,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:41,717 INFO L93 Difference]: Finished difference Result 283 states and 401 transitions. [2025-03-17 05:49:41,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:41,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2025-03-17 05:49:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:41,719 INFO L225 Difference]: With dead ends: 283 [2025-03-17 05:49:41,719 INFO L226 Difference]: Without dead ends: 183 [2025-03-17 05:49:41,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:41,720 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 117 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:41,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 695 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-17 05:49:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 171. [2025-03-17 05:49:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 139 states have (on average 1.3237410071942446) internal successors, (184), 140 states have internal predecessors, (184), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 05:49:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 242 transitions. [2025-03-17 05:49:41,741 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 242 transitions. Word has length 140 [2025-03-17 05:49:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:41,741 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 242 transitions. [2025-03-17 05:49:41,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 242 transitions. [2025-03-17 05:49:41,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:49:41,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:41,744 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:41,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:49:41,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:41,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:41,744 INFO L85 PathProgramCache]: Analyzing trace with hash 719774, now seen corresponding path program 1 times [2025-03-17 05:49:41,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:41,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452043461] [2025-03-17 05:49:41,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:41,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:41,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:49:41,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:49:41,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:41,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:42,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:42,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452043461] [2025-03-17 05:49:42,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452043461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:42,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:42,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:49:42,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394924346] [2025-03-17 05:49:42,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:42,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:49:42,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:42,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:49:42,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:49:42,270 INFO L87 Difference]: Start difference. First operand 171 states and 242 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:42,460 INFO L93 Difference]: Finished difference Result 433 states and 610 transitions. [2025-03-17 05:49:42,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:49:42,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2025-03-17 05:49:42,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:42,467 INFO L225 Difference]: With dead ends: 433 [2025-03-17 05:49:42,468 INFO L226 Difference]: Without dead ends: 263 [2025-03-17 05:49:42,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:42,469 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 106 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:42,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 923 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-17 05:49:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2025-03-17 05:49:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 209 states have (on average 1.30622009569378) internal successors, (273), 212 states have internal predecessors, (273), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 05:49:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 363 transitions. [2025-03-17 05:49:42,512 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 363 transitions. Word has length 141 [2025-03-17 05:49:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:42,512 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 363 transitions. [2025-03-17 05:49:42,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 363 transitions. [2025-03-17 05:49:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:49:42,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:42,515 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:42,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:49:42,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:42,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash -151809044, now seen corresponding path program 1 times [2025-03-17 05:49:42,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:42,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927712147] [2025-03-17 05:49:42,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:42,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:42,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:49:42,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:49:42,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:42,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:43,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:43,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927712147] [2025-03-17 05:49:43,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927712147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:43,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:43,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:49:43,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398879651] [2025-03-17 05:49:43,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:43,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:49:43,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:43,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:49:43,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:49:43,126 INFO L87 Difference]: Start difference. First operand 259 states and 363 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:43,300 INFO L93 Difference]: Finished difference Result 506 states and 706 transitions. [2025-03-17 05:49:43,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:49:43,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 142 [2025-03-17 05:49:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:43,305 INFO L225 Difference]: With dead ends: 506 [2025-03-17 05:49:43,305 INFO L226 Difference]: Without dead ends: 268 [2025-03-17 05:49:43,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:49:43,306 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 148 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:43,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 850 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-17 05:49:43,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2025-03-17 05:49:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 218 states have internal predecessors, (279), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 05:49:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 369 transitions. [2025-03-17 05:49:43,346 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 369 transitions. Word has length 142 [2025-03-17 05:49:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:43,347 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 369 transitions. [2025-03-17 05:49:43,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 369 transitions. [2025-03-17 05:49:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:49:43,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:43,348 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:43,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:49:43,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:43,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash 603902105, now seen corresponding path program 1 times [2025-03-17 05:49:43,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:43,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091774778] [2025-03-17 05:49:43,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:43,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:43,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:49:43,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:49:43,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:43,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:43,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:43,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091774778] [2025-03-17 05:49:43,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091774778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:43,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:43,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:43,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390801977] [2025-03-17 05:49:43,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:43,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:43,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:43,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:43,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:43,569 INFO L87 Difference]: Start difference. First operand 266 states and 369 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:43,621 INFO L93 Difference]: Finished difference Result 501 states and 693 transitions. [2025-03-17 05:49:43,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:43,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 142 [2025-03-17 05:49:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:43,623 INFO L225 Difference]: With dead ends: 501 [2025-03-17 05:49:43,623 INFO L226 Difference]: Without dead ends: 256 [2025-03-17 05:49:43,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:43,624 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 50 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:43,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 598 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:43,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-17 05:49:43,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2025-03-17 05:49:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 203 states have (on average 1.2758620689655173) internal successors, (259), 206 states have internal predecessors, (259), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 05:49:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 349 transitions. [2025-03-17 05:49:43,638 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 349 transitions. Word has length 142 [2025-03-17 05:49:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:43,639 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 349 transitions. [2025-03-17 05:49:43,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 349 transitions. [2025-03-17 05:49:43,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:49:43,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:43,640 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:43,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:49:43,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:43,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash 808741781, now seen corresponding path program 1 times [2025-03-17 05:49:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:43,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458272483] [2025-03-17 05:49:43,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:43,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:43,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:49:43,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:49:43,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:43,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:43,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:43,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458272483] [2025-03-17 05:49:43,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458272483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:43,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:43,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:43,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732597843] [2025-03-17 05:49:43,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:43,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:43,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:43,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:43,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:43,838 INFO L87 Difference]: Start difference. First operand 254 states and 349 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:43,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:43,891 INFO L93 Difference]: Finished difference Result 483 states and 662 transitions. [2025-03-17 05:49:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:43,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2025-03-17 05:49:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:43,893 INFO L225 Difference]: With dead ends: 483 [2025-03-17 05:49:43,893 INFO L226 Difference]: Without dead ends: 250 [2025-03-17 05:49:43,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:43,894 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 54 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:43,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 643 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-17 05:49:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2025-03-17 05:49:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 197 states have (on average 1.263959390862944) internal successors, (249), 200 states have internal predecessors, (249), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 05:49:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 339 transitions. [2025-03-17 05:49:43,912 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 339 transitions. Word has length 143 [2025-03-17 05:49:43,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:43,912 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 339 transitions. [2025-03-17 05:49:43,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 339 transitions. [2025-03-17 05:49:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:49:43,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:43,914 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:43,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:49:43,914 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:43,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1634004517, now seen corresponding path program 1 times [2025-03-17 05:49:43,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:43,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493020556] [2025-03-17 05:49:43,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:43,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:43,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:49:43,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:49:43,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:43,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:44,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493020556] [2025-03-17 05:49:44,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493020556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:44,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:44,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:49:44,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878895648] [2025-03-17 05:49:44,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:44,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:49:44,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:44,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:49:44,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:49:44,502 INFO L87 Difference]: Start difference. First operand 248 states and 339 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:49:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:44,871 INFO L93 Difference]: Finished difference Result 534 states and 727 transitions. [2025-03-17 05:49:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:49:44,872 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 143 [2025-03-17 05:49:44,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:44,875 INFO L225 Difference]: With dead ends: 534 [2025-03-17 05:49:44,876 INFO L226 Difference]: Without dead ends: 307 [2025-03-17 05:49:44,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:49:44,878 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 225 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:44,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 836 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:49:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-17 05:49:44,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 304. [2025-03-17 05:49:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 248 states have (on average 1.2701612903225807) internal successors, (315), 252 states have internal predecessors, (315), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 05:49:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 413 transitions. [2025-03-17 05:49:44,908 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 413 transitions. Word has length 143 [2025-03-17 05:49:44,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:44,909 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 413 transitions. [2025-03-17 05:49:44,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:49:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 413 transitions. [2025-03-17 05:49:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:49:44,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:44,911 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:44,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:49:44,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:44,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:44,911 INFO L85 PathProgramCache]: Analyzing trace with hash -126452708, now seen corresponding path program 1 times [2025-03-17 05:49:44,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:44,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301461496] [2025-03-17 05:49:44,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:44,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:49:44,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:49:44,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:44,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:45,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:45,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301461496] [2025-03-17 05:49:45,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301461496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:45,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:45,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:49:45,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430511265] [2025-03-17 05:49:45,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:45,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:49:45,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:45,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:49:45,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:49:45,669 INFO L87 Difference]: Start difference. First operand 304 states and 413 transitions. Second operand has 13 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-17 05:49:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:46,322 INFO L93 Difference]: Finished difference Result 593 states and 800 transitions. [2025-03-17 05:49:46,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:49:46,323 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 143 [2025-03-17 05:49:46,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:46,324 INFO L225 Difference]: With dead ends: 593 [2025-03-17 05:49:46,325 INFO L226 Difference]: Without dead ends: 310 [2025-03-17 05:49:46,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:49:46,326 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 354 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:46,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 792 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:49:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-17 05:49:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2025-03-17 05:49:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 250 states have (on average 1.26) internal successors, (315), 254 states have internal predecessors, (315), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 05:49:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 413 transitions. [2025-03-17 05:49:46,349 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 413 transitions. Word has length 143 [2025-03-17 05:49:46,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:46,349 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 413 transitions. [2025-03-17 05:49:46,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-17 05:49:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 413 transitions. [2025-03-17 05:49:46,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:49:46,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:46,351 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:46,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:49:46,351 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:46,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:46,351 INFO L85 PathProgramCache]: Analyzing trace with hash 583753436, now seen corresponding path program 1 times [2025-03-17 05:49:46,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:46,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417125680] [2025-03-17 05:49:46,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:46,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:46,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:49:46,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:49:46,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:46,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:46,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:46,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417125680] [2025-03-17 05:49:46,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417125680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:46,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:46,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:49:46,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092813424] [2025-03-17 05:49:46,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:46,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:49:46,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:46,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:49:46,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:49:46,779 INFO L87 Difference]: Start difference. First operand 308 states and 413 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:49:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:47,181 INFO L93 Difference]: Finished difference Result 597 states and 799 transitions. [2025-03-17 05:49:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:49:47,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 143 [2025-03-17 05:49:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:47,184 INFO L225 Difference]: With dead ends: 597 [2025-03-17 05:49:47,184 INFO L226 Difference]: Without dead ends: 314 [2025-03-17 05:49:47,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:49:47,185 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 226 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:47,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 572 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:49:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-17 05:49:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2025-03-17 05:49:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 253 states have (on average 1.2529644268774704) internal successors, (317), 257 states have internal predecessors, (317), 49 states have call successors, (49), 9 states have call predecessors, (49), 9 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 05:49:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 415 transitions. [2025-03-17 05:49:47,233 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 415 transitions. Word has length 143 [2025-03-17 05:49:47,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:47,233 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 415 transitions. [2025-03-17 05:49:47,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:49:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 415 transitions. [2025-03-17 05:49:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:49:47,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:47,235 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:47,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:49:47,235 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:47,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2091305245, now seen corresponding path program 1 times [2025-03-17 05:49:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:47,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969026948] [2025-03-17 05:49:47,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:47,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:47,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:49:47,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:49:47,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:47,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:47,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:47,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969026948] [2025-03-17 05:49:47,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969026948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:47,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:47,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:49:47,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420225870] [2025-03-17 05:49:47,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:47,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:49:47,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:47,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:49:47,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:49:47,542 INFO L87 Difference]: Start difference. First operand 312 states and 415 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:47,659 INFO L93 Difference]: Finished difference Result 649 states and 867 transitions. [2025-03-17 05:49:47,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:49:47,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2025-03-17 05:49:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:47,662 INFO L225 Difference]: With dead ends: 649 [2025-03-17 05:49:47,662 INFO L226 Difference]: Without dead ends: 362 [2025-03-17 05:49:47,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:49:47,663 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 113 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:47,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1360 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-17 05:49:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 350. [2025-03-17 05:49:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 274 states have (on average 1.22992700729927) internal successors, (337), 278 states have internal predecessors, (337), 64 states have call successors, (64), 11 states have call predecessors, (64), 11 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-17 05:49:47,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 465 transitions. [2025-03-17 05:49:47,712 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 465 transitions. Word has length 143 [2025-03-17 05:49:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:47,713 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 465 transitions. [2025-03-17 05:49:47,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 465 transitions. [2025-03-17 05:49:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:49:47,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:47,715 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:47,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:49:47,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:47,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:47,716 INFO L85 PathProgramCache]: Analyzing trace with hash -117219454, now seen corresponding path program 1 times [2025-03-17 05:49:47,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:47,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079723533] [2025-03-17 05:49:47,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:47,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:47,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:49:47,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:49:47,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:47,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:47,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:47,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079723533] [2025-03-17 05:49:47,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079723533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:47,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:47,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:47,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169204073] [2025-03-17 05:49:47,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:47,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:47,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:47,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:47,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:47,931 INFO L87 Difference]: Start difference. First operand 350 states and 465 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:48,068 INFO L93 Difference]: Finished difference Result 732 states and 974 transitions. [2025-03-17 05:49:48,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:48,069 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-17 05:49:48,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:48,070 INFO L225 Difference]: With dead ends: 732 [2025-03-17 05:49:48,071 INFO L226 Difference]: Without dead ends: 407 [2025-03-17 05:49:48,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:48,073 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 60 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:48,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 533 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-17 05:49:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 404. [2025-03-17 05:49:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 325 states have (on average 1.2461538461538462) internal successors, (405), 330 states have internal predecessors, (405), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 537 transitions. [2025-03-17 05:49:48,107 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 537 transitions. Word has length 144 [2025-03-17 05:49:48,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:48,108 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 537 transitions. [2025-03-17 05:49:48,108 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 537 transitions. [2025-03-17 05:49:48,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:49:48,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:48,110 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:48,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:49:48,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:48,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:48,111 INFO L85 PathProgramCache]: Analyzing trace with hash 393314723, now seen corresponding path program 1 times [2025-03-17 05:49:48,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:48,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671766880] [2025-03-17 05:49:48,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:48,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:48,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:49:48,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:49:48,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:48,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:48,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:48,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671766880] [2025-03-17 05:49:48,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671766880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:48,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:48,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:49:48,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657336199] [2025-03-17 05:49:48,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:48,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:49:48,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:48,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:49:48,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:48,474 INFO L87 Difference]: Start difference. First operand 404 states and 537 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:48,740 INFO L93 Difference]: Finished difference Result 900 states and 1198 transitions. [2025-03-17 05:49:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:49:48,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-17 05:49:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:48,742 INFO L225 Difference]: With dead ends: 900 [2025-03-17 05:49:48,743 INFO L226 Difference]: Without dead ends: 521 [2025-03-17 05:49:48,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:49:48,744 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 85 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:48,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1110 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:49:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-17 05:49:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 518. [2025-03-17 05:49:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 429 states have (on average 1.2587412587412588) internal successors, (540), 436 states have internal predecessors, (540), 74 states have call successors, (74), 14 states have call predecessors, (74), 14 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 05:49:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 688 transitions. [2025-03-17 05:49:48,779 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 688 transitions. Word has length 144 [2025-03-17 05:49:48,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:48,780 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 688 transitions. [2025-03-17 05:49:48,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:48,780 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 688 transitions. [2025-03-17 05:49:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:49:48,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:48,781 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:48,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:49:48,781 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:48,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:48,782 INFO L85 PathProgramCache]: Analyzing trace with hash 732214118, now seen corresponding path program 1 times [2025-03-17 05:49:48,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:48,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856185062] [2025-03-17 05:49:48,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:48,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:48,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:49:48,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:49:48,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:48,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:48,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:48,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856185062] [2025-03-17 05:49:48,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856185062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:48,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:48,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:48,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033263173] [2025-03-17 05:49:48,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:48,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:48,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:48,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:48,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:48,914 INFO L87 Difference]: Start difference. First operand 518 states and 688 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:49,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:49,021 INFO L93 Difference]: Finished difference Result 1014 states and 1347 transitions. [2025-03-17 05:49:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:49,021 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-17 05:49:49,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:49,024 INFO L225 Difference]: With dead ends: 1014 [2025-03-17 05:49:49,024 INFO L226 Difference]: Without dead ends: 521 [2025-03-17 05:49:49,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:49,025 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 93 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:49,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 570 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-17 05:49:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 518. [2025-03-17 05:49:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 429 states have (on average 1.2564102564102564) internal successors, (539), 436 states have internal predecessors, (539), 74 states have call successors, (74), 14 states have call predecessors, (74), 14 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 05:49:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 687 transitions. [2025-03-17 05:49:49,076 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 687 transitions. Word has length 144 [2025-03-17 05:49:49,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:49,077 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 687 transitions. [2025-03-17 05:49:49,077 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 687 transitions. [2025-03-17 05:49:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:49:49,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:49,078 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:49,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:49:49,079 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:49,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2109656745, now seen corresponding path program 1 times [2025-03-17 05:49:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:49,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501598722] [2025-03-17 05:49:49,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:49,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:49:49,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:49:49,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:49,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:49,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:49,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501598722] [2025-03-17 05:49:49,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501598722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:49,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:49,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:49,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230844739] [2025-03-17 05:49:49,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:49,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:49,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:49,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:49,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:49,243 INFO L87 Difference]: Start difference. First operand 518 states and 687 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:49,338 INFO L93 Difference]: Finished difference Result 1014 states and 1345 transitions. [2025-03-17 05:49:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:49,339 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-17 05:49:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:49,341 INFO L225 Difference]: With dead ends: 1014 [2025-03-17 05:49:49,341 INFO L226 Difference]: Without dead ends: 521 [2025-03-17 05:49:49,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:49,343 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 97 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:49,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 564 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-17 05:49:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 518. [2025-03-17 05:49:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 429 states have (on average 1.254079254079254) internal successors, (538), 436 states have internal predecessors, (538), 74 states have call successors, (74), 14 states have call predecessors, (74), 14 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 05:49:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 686 transitions. [2025-03-17 05:49:49,378 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 686 transitions. Word has length 144 [2025-03-17 05:49:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:49,379 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 686 transitions. [2025-03-17 05:49:49,379 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 686 transitions. [2025-03-17 05:49:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:49:49,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:49,380 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:49,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:49:49,380 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:49,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash -832000854, now seen corresponding path program 1 times [2025-03-17 05:49:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:49,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282544157] [2025-03-17 05:49:49,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:49,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:49,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:49:49,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:49:49,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:49,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:49,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282544157] [2025-03-17 05:49:49,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282544157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:49,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:49,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:49,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956333080] [2025-03-17 05:49:49,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:49,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:49,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:49,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:49,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:49,514 INFO L87 Difference]: Start difference. First operand 518 states and 686 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:49,606 INFO L93 Difference]: Finished difference Result 1012 states and 1338 transitions. [2025-03-17 05:49:49,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:49,606 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-17 05:49:49,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:49,609 INFO L225 Difference]: With dead ends: 1012 [2025-03-17 05:49:49,609 INFO L226 Difference]: Without dead ends: 519 [2025-03-17 05:49:49,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:49,611 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 64 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:49,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 688 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:49,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-17 05:49:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 516. [2025-03-17 05:49:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 426 states have (on average 1.2488262910798122) internal successors, (532), 433 states have internal predecessors, (532), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 05:49:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 680 transitions. [2025-03-17 05:49:49,648 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 680 transitions. Word has length 144 [2025-03-17 05:49:49,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:49,649 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 680 transitions. [2025-03-17 05:49:49,649 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:49:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 680 transitions. [2025-03-17 05:49:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:49:49,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:49,651 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:49,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:49:49,652 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:49,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:49,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2023460459, now seen corresponding path program 1 times [2025-03-17 05:49:49,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:49,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765088638] [2025-03-17 05:49:49,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:49,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:49,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:49:49,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:49:49,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:49,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:50,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:50,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765088638] [2025-03-17 05:49:50,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765088638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:50,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:50,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 05:49:50,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535069343] [2025-03-17 05:49:50,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:50,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:49:50,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:50,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:49:50,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:49:50,589 INFO L87 Difference]: Start difference. First operand 516 states and 680 transitions. Second operand has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-17 05:49:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:51,557 INFO L93 Difference]: Finished difference Result 1106 states and 1451 transitions. [2025-03-17 05:49:51,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:49:51,557 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 145 [2025-03-17 05:49:51,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:51,560 INFO L225 Difference]: With dead ends: 1106 [2025-03-17 05:49:51,560 INFO L226 Difference]: Without dead ends: 615 [2025-03-17 05:49:51,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2025-03-17 05:49:51,562 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 526 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:51,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1274 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:49:51,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-03-17 05:49:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 533. [2025-03-17 05:49:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 443 states have (on average 1.2505643340857788) internal successors, (554), 450 states have internal predecessors, (554), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 05:49:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 702 transitions. [2025-03-17 05:49:51,605 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 702 transitions. Word has length 145 [2025-03-17 05:49:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:51,605 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 702 transitions. [2025-03-17 05:49:51,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-17 05:49:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 702 transitions. [2025-03-17 05:49:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:49:51,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:51,607 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:51,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:49:51,607 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:51,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:51,608 INFO L85 PathProgramCache]: Analyzing trace with hash 291463255, now seen corresponding path program 1 times [2025-03-17 05:49:51,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:51,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383585914] [2025-03-17 05:49:51,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:51,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:51,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:49:51,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:49:51,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:51,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:52,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383585914] [2025-03-17 05:49:52,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383585914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:52,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:52,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-17 05:49:52,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019929830] [2025-03-17 05:49:52,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:52,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 05:49:52,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:52,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 05:49:52,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:49:52,961 INFO L87 Difference]: Start difference. First operand 533 states and 702 transitions. Second operand has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 19 states have internal predecessors, (53), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2025-03-17 05:49:54,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:54,520 INFO L93 Difference]: Finished difference Result 1140 states and 1495 transitions. [2025-03-17 05:49:54,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 05:49:54,521 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 19 states have internal predecessors, (53), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) Word has length 145 [2025-03-17 05:49:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:54,524 INFO L225 Difference]: With dead ends: 1140 [2025-03-17 05:49:54,524 INFO L226 Difference]: Without dead ends: 632 [2025-03-17 05:49:54,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=917, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 05:49:54,526 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 550 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:54,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1523 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:49:54,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-17 05:49:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 550. [2025-03-17 05:49:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 460 states have (on average 1.2521739130434784) internal successors, (576), 467 states have internal predecessors, (576), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 05:49:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 724 transitions. [2025-03-17 05:49:54,555 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 724 transitions. Word has length 145 [2025-03-17 05:49:54,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:54,555 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 724 transitions. [2025-03-17 05:49:54,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 19 states have internal predecessors, (53), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2025-03-17 05:49:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 724 transitions. [2025-03-17 05:49:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 05:49:54,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:54,557 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:54,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:49:54,557 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:54,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:54,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1939307327, now seen corresponding path program 1 times [2025-03-17 05:49:54,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:54,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7045060] [2025-03-17 05:49:54,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:54,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:54,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 05:49:54,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 05:49:54,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:54,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:55,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:55,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7045060] [2025-03-17 05:49:55,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7045060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:55,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:55,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 05:49:55,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761337271] [2025-03-17 05:49:55,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:55,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:49:55,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:55,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:49:55,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:49:55,221 INFO L87 Difference]: Start difference. First operand 550 states and 724 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-17 05:49:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:56,207 INFO L93 Difference]: Finished difference Result 1123 states and 1476 transitions. [2025-03-17 05:49:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:49:56,208 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 146 [2025-03-17 05:49:56,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:56,211 INFO L225 Difference]: With dead ends: 1123 [2025-03-17 05:49:56,211 INFO L226 Difference]: Without dead ends: 598 [2025-03-17 05:49:56,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:49:56,213 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 256 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:56,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1207 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:49:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-17 05:49:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 556. [2025-03-17 05:49:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 466 states have (on average 1.2510729613733906) internal successors, (583), 473 states have internal predecessors, (583), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 05:49:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 731 transitions. [2025-03-17 05:49:56,245 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 731 transitions. Word has length 146 [2025-03-17 05:49:56,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:56,246 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 731 transitions. [2025-03-17 05:49:56,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-17 05:49:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 731 transitions. [2025-03-17 05:49:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 05:49:56,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:56,247 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:56,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:49:56,247 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:56,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:56,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1946835744, now seen corresponding path program 1 times [2025-03-17 05:49:56,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:56,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089796564] [2025-03-17 05:49:56,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:56,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:56,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 05:49:56,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 05:49:56,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:56,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:56,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:56,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089796564] [2025-03-17 05:49:56,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089796564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:56,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:56,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:49:56,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122046903] [2025-03-17 05:49:56,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:56,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:49:56,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:56,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:49:56,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:49:56,641 INFO L87 Difference]: Start difference. First operand 556 states and 731 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:49:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:57,145 INFO L93 Difference]: Finished difference Result 1090 states and 1433 transitions. [2025-03-17 05:49:57,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:49:57,146 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 146 [2025-03-17 05:49:57,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:57,149 INFO L225 Difference]: With dead ends: 1090 [2025-03-17 05:49:57,149 INFO L226 Difference]: Without dead ends: 559 [2025-03-17 05:49:57,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:49:57,151 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 188 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:57,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 818 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:49:57,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-17 05:49:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 550. [2025-03-17 05:49:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 460 states have (on average 1.25) internal successors, (575), 467 states have internal predecessors, (575), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 05:49:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 723 transitions. [2025-03-17 05:49:57,178 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 723 transitions. Word has length 146 [2025-03-17 05:49:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:57,179 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 723 transitions. [2025-03-17 05:49:57,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:49:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 723 transitions. [2025-03-17 05:49:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 05:49:57,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:57,181 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:57,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:49:57,181 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:57,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:57,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1357021147, now seen corresponding path program 1 times [2025-03-17 05:49:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177103806] [2025-03-17 05:49:57,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:57,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:57,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 05:49:57,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 05:49:57,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:57,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:57,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:57,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177103806] [2025-03-17 05:49:57,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177103806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:57,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:57,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:49:57,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399125021] [2025-03-17 05:49:57,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:57,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:49:57,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:57,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:49:57,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:49:57,683 INFO L87 Difference]: Start difference. First operand 550 states and 723 transitions. Second operand has 13 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-17 05:49:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:58,097 INFO L93 Difference]: Finished difference Result 1073 states and 1410 transitions. [2025-03-17 05:49:58,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:49:58,100 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 146 [2025-03-17 05:49:58,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:58,103 INFO L225 Difference]: With dead ends: 1073 [2025-03-17 05:49:58,103 INFO L226 Difference]: Without dead ends: 548 [2025-03-17 05:49:58,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:49:58,106 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 445 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:58,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 668 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:49:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-17 05:49:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 545. [2025-03-17 05:49:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 455 states have (on average 1.2461538461538462) internal successors, (567), 462 states have internal predecessors, (567), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 05:49:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 715 transitions. [2025-03-17 05:49:58,134 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 715 transitions. Word has length 146 [2025-03-17 05:49:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:58,135 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 715 transitions. [2025-03-17 05:49:58,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-17 05:49:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 715 transitions. [2025-03-17 05:49:58,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 05:49:58,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:58,136 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:58,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:49:58,136 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:58,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:58,137 INFO L85 PathProgramCache]: Analyzing trace with hash 610144093, now seen corresponding path program 1 times [2025-03-17 05:49:58,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:58,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690441858] [2025-03-17 05:49:58,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:58,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:58,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 05:49:58,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 05:49:58,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:58,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:58,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:58,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690441858] [2025-03-17 05:49:58,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690441858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:58,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:58,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:49:58,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904708495] [2025-03-17 05:49:58,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:58,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:49:58,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:58,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:49:58,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:49:58,663 INFO L87 Difference]: Start difference. First operand 545 states and 715 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:49:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:59,172 INFO L93 Difference]: Finished difference Result 1599 states and 2085 transitions. [2025-03-17 05:49:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:49:59,173 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 146 [2025-03-17 05:49:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:59,176 INFO L225 Difference]: With dead ends: 1599 [2025-03-17 05:49:59,177 INFO L226 Difference]: Without dead ends: 1079 [2025-03-17 05:49:59,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:49:59,179 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 548 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:59,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 806 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:49:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2025-03-17 05:49:59,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 602. [2025-03-17 05:49:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 512 states have (on average 1.26171875) internal successors, (646), 519 states have internal predecessors, (646), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 05:49:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 794 transitions. [2025-03-17 05:49:59,210 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 794 transitions. Word has length 146 [2025-03-17 05:49:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:59,211 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 794 transitions. [2025-03-17 05:49:59,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:49:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 794 transitions. [2025-03-17 05:49:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 05:49:59,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:59,212 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:59,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:49:59,212 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:59,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:59,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1756739807, now seen corresponding path program 1 times [2025-03-17 05:49:59,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:59,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663071604] [2025-03-17 05:49:59,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:59,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:59,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 05:49:59,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 05:49:59,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:59,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:59,405 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:59,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:59,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663071604] [2025-03-17 05:49:59,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663071604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:59,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:59,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:49:59,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746747025] [2025-03-17 05:49:59,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:59,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:49:59,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:59,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:49:59,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:49:59,407 INFO L87 Difference]: Start difference. First operand 602 states and 794 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:49:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:59,696 INFO L93 Difference]: Finished difference Result 1241 states and 1633 transitions. [2025-03-17 05:49:59,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:49:59,696 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 146 [2025-03-17 05:49:59,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:59,699 INFO L225 Difference]: With dead ends: 1241 [2025-03-17 05:49:59,699 INFO L226 Difference]: Without dead ends: 664 [2025-03-17 05:49:59,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:49:59,701 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 311 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:59,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 758 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:49:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-17 05:49:59,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 570. [2025-03-17 05:49:59,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 484 states have (on average 1.256198347107438) internal successors, (608), 490 states have internal predecessors, (608), 70 states have call successors, (70), 15 states have call predecessors, (70), 15 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 05:49:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 748 transitions. [2025-03-17 05:49:59,729 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 748 transitions. Word has length 146 [2025-03-17 05:49:59,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:59,729 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 748 transitions. [2025-03-17 05:49:59,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:49:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 748 transitions. [2025-03-17 05:49:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 05:49:59,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:59,731 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:59,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:49:59,731 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:59,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:59,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1246205630, now seen corresponding path program 1 times [2025-03-17 05:49:59,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:59,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861199122] [2025-03-17 05:49:59,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:59,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:59,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 05:49:59,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 05:49:59,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:59,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:49:59,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:59,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861199122] [2025-03-17 05:49:59,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861199122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:59,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:59,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:49:59,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097802527] [2025-03-17 05:49:59,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:59,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:49:59,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:59,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:49:59,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:59,897 INFO L87 Difference]: Start difference. First operand 570 states and 748 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:00,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:00,051 INFO L93 Difference]: Finished difference Result 1163 states and 1522 transitions. [2025-03-17 05:50:00,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:50:00,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2025-03-17 05:50:00,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:00,055 INFO L225 Difference]: With dead ends: 1163 [2025-03-17 05:50:00,055 INFO L226 Difference]: Without dead ends: 614 [2025-03-17 05:50:00,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:50:00,056 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 67 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 689 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:00,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 689 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:50:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-03-17 05:50:00,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 540. [2025-03-17 05:50:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 456 states have (on average 1.2521929824561404) internal successors, (571), 461 states have internal predecessors, (571), 68 states have call successors, (68), 15 states have call predecessors, (68), 15 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:50:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 707 transitions. [2025-03-17 05:50:00,089 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 707 transitions. Word has length 146 [2025-03-17 05:50:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:00,089 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 707 transitions. [2025-03-17 05:50:00,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 707 transitions. [2025-03-17 05:50:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 05:50:00,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:00,091 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:00,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:50:00,091 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:00,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:00,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1215185823, now seen corresponding path program 1 times [2025-03-17 05:50:00,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:00,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160304157] [2025-03-17 05:50:00,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:00,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:00,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 05:50:00,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 05:50:00,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:00,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:00,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:00,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160304157] [2025-03-17 05:50:00,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160304157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:00,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:00,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:50:00,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738019789] [2025-03-17 05:50:00,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:00,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:50:00,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:00,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:50:00,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:50:00,369 INFO L87 Difference]: Start difference. First operand 540 states and 707 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:00,891 INFO L93 Difference]: Finished difference Result 1149 states and 1501 transitions. [2025-03-17 05:50:00,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:50:00,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2025-03-17 05:50:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:00,894 INFO L225 Difference]: With dead ends: 1149 [2025-03-17 05:50:00,894 INFO L226 Difference]: Without dead ends: 630 [2025-03-17 05:50:00,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:50:00,895 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 130 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:00,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1358 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:50:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-03-17 05:50:00,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 536. [2025-03-17 05:50:00,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 452 states have (on average 1.241150442477876) internal successors, (561), 457 states have internal predecessors, (561), 68 states have call successors, (68), 15 states have call predecessors, (68), 15 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:50:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 697 transitions. [2025-03-17 05:50:00,932 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 697 transitions. Word has length 146 [2025-03-17 05:50:00,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:00,932 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 697 transitions. [2025-03-17 05:50:00,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:00,932 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 697 transitions. [2025-03-17 05:50:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 05:50:00,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:00,933 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:00,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:50:00,933 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:00,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:00,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1660991803, now seen corresponding path program 1 times [2025-03-17 05:50:00,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:00,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638914793] [2025-03-17 05:50:00,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:00,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:00,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 05:50:00,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 05:50:00,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:00,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:01,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:01,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638914793] [2025-03-17 05:50:01,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638914793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:01,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:01,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:50:01,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127445640] [2025-03-17 05:50:01,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:01,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:50:01,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:01,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:50:01,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:50:01,053 INFO L87 Difference]: Start difference. First operand 536 states and 697 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:01,190 INFO L93 Difference]: Finished difference Result 1107 states and 1437 transitions. [2025-03-17 05:50:01,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:50:01,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2025-03-17 05:50:01,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:01,194 INFO L225 Difference]: With dead ends: 1107 [2025-03-17 05:50:01,194 INFO L226 Difference]: Without dead ends: 592 [2025-03-17 05:50:01,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:50:01,195 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 63 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:01,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 859 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:50:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-17 05:50:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 532. [2025-03-17 05:50:01,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 448 states have (on average 1.2388392857142858) internal successors, (555), 453 states have internal predecessors, (555), 68 states have call successors, (68), 15 states have call predecessors, (68), 15 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:50:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 691 transitions. [2025-03-17 05:50:01,226 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 691 transitions. Word has length 146 [2025-03-17 05:50:01,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:01,227 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 691 transitions. [2025-03-17 05:50:01,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 691 transitions. [2025-03-17 05:50:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 05:50:01,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:01,228 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:01,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:50:01,228 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:01,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:01,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1309436087, now seen corresponding path program 1 times [2025-03-17 05:50:01,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:01,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705958320] [2025-03-17 05:50:01,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:01,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:01,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 05:50:01,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 05:50:01,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:01,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:01,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:01,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705958320] [2025-03-17 05:50:01,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705958320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:01,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:01,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:50:01,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350627207] [2025-03-17 05:50:01,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:01,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:50:01,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:01,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:50:01,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:50:01,701 INFO L87 Difference]: Start difference. First operand 532 states and 691 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:50:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:02,111 INFO L93 Difference]: Finished difference Result 1231 states and 1591 transitions. [2025-03-17 05:50:02,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:50:02,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 146 [2025-03-17 05:50:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:02,114 INFO L225 Difference]: With dead ends: 1231 [2025-03-17 05:50:02,114 INFO L226 Difference]: Without dead ends: 720 [2025-03-17 05:50:02,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:50:02,116 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 204 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:02,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1250 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:50:02,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-17 05:50:02,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 618. [2025-03-17 05:50:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 517 states have (on average 1.2263056092843327) internal successors, (634), 524 states have internal predecessors, (634), 80 states have call successors, (80), 20 states have call predecessors, (80), 20 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:50:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 794 transitions. [2025-03-17 05:50:02,153 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 794 transitions. Word has length 146 [2025-03-17 05:50:02,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:02,154 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 794 transitions. [2025-03-17 05:50:02,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:50:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 794 transitions. [2025-03-17 05:50:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:50:02,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:02,155 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:02,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:50:02,155 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:02,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:02,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2027415474, now seen corresponding path program 1 times [2025-03-17 05:50:02,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:02,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398391172] [2025-03-17 05:50:02,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:02,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:02,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:50:02,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:50:02,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:02,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:02,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:02,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398391172] [2025-03-17 05:50:02,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398391172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:02,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:02,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:50:02,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876442824] [2025-03-17 05:50:02,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:02,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:50:02,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:02,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:50:02,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:50:02,323 INFO L87 Difference]: Start difference. First operand 618 states and 794 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:02,446 INFO L93 Difference]: Finished difference Result 1300 states and 1664 transitions. [2025-03-17 05:50:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:50:02,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-03-17 05:50:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:02,457 INFO L225 Difference]: With dead ends: 1300 [2025-03-17 05:50:02,457 INFO L226 Difference]: Without dead ends: 701 [2025-03-17 05:50:02,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:50:02,459 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 109 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:02,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 768 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:50:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-17 05:50:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 697. [2025-03-17 05:50:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 574 states have (on average 1.2125435540069687) internal successors, (696), 582 states have internal predecessors, (696), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 05:50:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 888 transitions. [2025-03-17 05:50:02,503 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 888 transitions. Word has length 147 [2025-03-17 05:50:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:02,503 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 888 transitions. [2025-03-17 05:50:02,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 888 transitions. [2025-03-17 05:50:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:50:02,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:02,505 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:02,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 05:50:02,505 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:02,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:02,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1182943603, now seen corresponding path program 1 times [2025-03-17 05:50:02,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:02,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640744072] [2025-03-17 05:50:02,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:02,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:02,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:50:02,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:50:02,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:02,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:02,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:02,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640744072] [2025-03-17 05:50:02,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640744072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:02,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:02,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:50:02,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486606294] [2025-03-17 05:50:02,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:02,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:50:02,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:02,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:50:02,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:50:02,658 INFO L87 Difference]: Start difference. First operand 697 states and 888 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:02,791 INFO L93 Difference]: Finished difference Result 1366 states and 1741 transitions. [2025-03-17 05:50:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:50:02,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-03-17 05:50:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:02,794 INFO L225 Difference]: With dead ends: 1366 [2025-03-17 05:50:02,794 INFO L226 Difference]: Without dead ends: 690 [2025-03-17 05:50:02,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:50:02,796 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 102 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:02,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 802 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:50:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-17 05:50:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 686. [2025-03-17 05:50:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 563 states have (on average 1.2078152753108349) internal successors, (680), 571 states have internal predecessors, (680), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 05:50:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 872 transitions. [2025-03-17 05:50:02,848 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 872 transitions. Word has length 147 [2025-03-17 05:50:02,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:02,848 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 872 transitions. [2025-03-17 05:50:02,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:02,848 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 872 transitions. [2025-03-17 05:50:02,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:50:02,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:02,849 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:02,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 05:50:02,849 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:02,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:02,850 INFO L85 PathProgramCache]: Analyzing trace with hash 482117048, now seen corresponding path program 1 times [2025-03-17 05:50:02,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:02,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679411260] [2025-03-17 05:50:02,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:02,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:02,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:50:02,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:50:02,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:02,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:03,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:03,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679411260] [2025-03-17 05:50:03,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679411260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:03,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:03,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:50:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866283499] [2025-03-17 05:50:03,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:03,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:50:03,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:03,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:50:03,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:50:03,055 INFO L87 Difference]: Start difference. First operand 686 states and 872 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:03,267 INFO L93 Difference]: Finished difference Result 1486 states and 1880 transitions. [2025-03-17 05:50:03,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:50:03,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-03-17 05:50:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:03,270 INFO L225 Difference]: With dead ends: 1486 [2025-03-17 05:50:03,270 INFO L226 Difference]: Without dead ends: 821 [2025-03-17 05:50:03,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:50:03,272 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 211 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:03,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 918 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:50:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-03-17 05:50:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 788. [2025-03-17 05:50:03,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 644 states have (on average 1.200310559006211) internal successors, (773), 654 states have internal predecessors, (773), 112 states have call successors, (112), 31 states have call predecessors, (112), 31 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-17 05:50:03,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 997 transitions. [2025-03-17 05:50:03,324 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 997 transitions. Word has length 147 [2025-03-17 05:50:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:03,324 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 997 transitions. [2025-03-17 05:50:03,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 997 transitions. [2025-03-17 05:50:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:50:03,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:03,325 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:03,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 05:50:03,326 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:03,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:03,326 INFO L85 PathProgramCache]: Analyzing trace with hash 693467961, now seen corresponding path program 1 times [2025-03-17 05:50:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:03,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989180092] [2025-03-17 05:50:03,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:03,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:03,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:50:03,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:50:03,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:03,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:03,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:03,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989180092] [2025-03-17 05:50:03,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989180092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:03,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:03,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:50:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431925912] [2025-03-17 05:50:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:03,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:50:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:03,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:50:03,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:50:03,556 INFO L87 Difference]: Start difference. First operand 788 states and 997 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:03,704 INFO L93 Difference]: Finished difference Result 1563 states and 1974 transitions. [2025-03-17 05:50:03,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:50:03,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-03-17 05:50:03,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:03,707 INFO L225 Difference]: With dead ends: 1563 [2025-03-17 05:50:03,707 INFO L226 Difference]: Without dead ends: 796 [2025-03-17 05:50:03,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:50:03,711 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 161 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:03,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 619 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:50:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-17 05:50:03,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 661. [2025-03-17 05:50:03,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 552 states have (on average 1.2119565217391304) internal successors, (669), 560 states have internal predecessors, (669), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (83), 75 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 05:50:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 835 transitions. [2025-03-17 05:50:03,763 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 835 transitions. Word has length 147 [2025-03-17 05:50:03,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:03,764 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 835 transitions. [2025-03-17 05:50:03,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 835 transitions. [2025-03-17 05:50:03,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:50:03,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:03,765 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:03,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 05:50:03,765 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:03,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:03,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1033882685, now seen corresponding path program 1 times [2025-03-17 05:50:03,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:03,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477332245] [2025-03-17 05:50:03,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:03,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:03,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:50:03,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:50:03,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:03,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:04,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:04,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477332245] [2025-03-17 05:50:04,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477332245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:04,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:04,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:50:04,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122194210] [2025-03-17 05:50:04,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:04,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:50:04,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:04,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:50:04,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:50:04,109 INFO L87 Difference]: Start difference. First operand 661 states and 835 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:04,407 INFO L93 Difference]: Finished difference Result 1440 states and 1817 transitions. [2025-03-17 05:50:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:50:04,408 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-03-17 05:50:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:04,410 INFO L225 Difference]: With dead ends: 1440 [2025-03-17 05:50:04,410 INFO L226 Difference]: Without dead ends: 780 [2025-03-17 05:50:04,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:50:04,412 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 63 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:04,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1214 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:50:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-03-17 05:50:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 692. [2025-03-17 05:50:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 583 states have (on average 1.216123499142367) internal successors, (709), 591 states have internal predecessors, (709), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (83), 75 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 05:50:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 875 transitions. [2025-03-17 05:50:04,456 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 875 transitions. Word has length 148 [2025-03-17 05:50:04,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:04,456 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 875 transitions. [2025-03-17 05:50:04,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 875 transitions. [2025-03-17 05:50:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:50:04,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:04,458 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:04,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 05:50:04,458 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:04,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:04,458 INFO L85 PathProgramCache]: Analyzing trace with hash 473669124, now seen corresponding path program 1 times [2025-03-17 05:50:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:04,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793612776] [2025-03-17 05:50:04,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:04,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:04,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:50:04,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:50:04,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:04,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:04,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:04,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793612776] [2025-03-17 05:50:04,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793612776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:04,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:04,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:50:04,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454107366] [2025-03-17 05:50:04,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:04,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:50:04,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:04,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:50:04,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:50:04,650 INFO L87 Difference]: Start difference. First operand 692 states and 875 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:04,837 INFO L93 Difference]: Finished difference Result 1464 states and 1846 transitions. [2025-03-17 05:50:04,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:50:04,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-03-17 05:50:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:04,840 INFO L225 Difference]: With dead ends: 1464 [2025-03-17 05:50:04,840 INFO L226 Difference]: Without dead ends: 773 [2025-03-17 05:50:04,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-17 05:50:04,842 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 45 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:04,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 803 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:50:04,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-03-17 05:50:04,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 695. [2025-03-17 05:50:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 586 states have (on average 1.2098976109215016) internal successors, (709), 594 states have internal predecessors, (709), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (83), 75 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 05:50:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 875 transitions. [2025-03-17 05:50:04,887 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 875 transitions. Word has length 148 [2025-03-17 05:50:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:04,887 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 875 transitions. [2025-03-17 05:50:04,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 875 transitions. [2025-03-17 05:50:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:50:04,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:04,889 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:04,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 05:50:04,889 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:04,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:04,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1288619230, now seen corresponding path program 1 times [2025-03-17 05:50:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:04,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593407278] [2025-03-17 05:50:04,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:04,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:04,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:50:04,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:50:04,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:04,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:05,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:05,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593407278] [2025-03-17 05:50:05,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593407278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:05,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:05,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:50:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961180496] [2025-03-17 05:50:05,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:05,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:50:05,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:05,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:50:05,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:50:05,200 INFO L87 Difference]: Start difference. First operand 695 states and 875 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:50:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:05,489 INFO L93 Difference]: Finished difference Result 1450 states and 1822 transitions. [2025-03-17 05:50:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:50:05,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2025-03-17 05:50:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:05,492 INFO L225 Difference]: With dead ends: 1450 [2025-03-17 05:50:05,492 INFO L226 Difference]: Without dead ends: 730 [2025-03-17 05:50:05,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:50:05,494 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 354 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:05,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 454 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:50:05,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-03-17 05:50:05,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 661. [2025-03-17 05:50:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 552 states have (on average 1.201086956521739) internal successors, (663), 560 states have internal predecessors, (663), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (83), 75 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 05:50:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 829 transitions. [2025-03-17 05:50:05,538 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 829 transitions. Word has length 148 [2025-03-17 05:50:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:05,538 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 829 transitions. [2025-03-17 05:50:05,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:50:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 829 transitions. [2025-03-17 05:50:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:50:05,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:05,540 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:05,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 05:50:05,540 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:05,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:05,540 INFO L85 PathProgramCache]: Analyzing trace with hash -427339837, now seen corresponding path program 1 times [2025-03-17 05:50:05,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:05,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778097417] [2025-03-17 05:50:05,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:05,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:05,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:50:05,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:50:05,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:05,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:05,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:05,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778097417] [2025-03-17 05:50:05,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778097417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:05,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:05,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:50:05,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3447027] [2025-03-17 05:50:05,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:05,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:50:05,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:05,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:50:05,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:50:05,795 INFO L87 Difference]: Start difference. First operand 661 states and 829 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:05,979 INFO L93 Difference]: Finished difference Result 1458 states and 1831 transitions. [2025-03-17 05:50:05,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:50:05,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-03-17 05:50:05,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:05,983 INFO L225 Difference]: With dead ends: 1458 [2025-03-17 05:50:05,983 INFO L226 Difference]: Without dead ends: 798 [2025-03-17 05:50:05,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:50:05,984 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 117 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:05,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 2060 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:50:05,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-03-17 05:50:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 650. [2025-03-17 05:50:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 541 states have (on average 1.1977818853974123) internal successors, (648), 549 states have internal predecessors, (648), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (83), 75 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 05:50:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 814 transitions. [2025-03-17 05:50:06,048 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 814 transitions. Word has length 148 [2025-03-17 05:50:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:06,048 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 814 transitions. [2025-03-17 05:50:06,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 814 transitions. [2025-03-17 05:50:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:50:06,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:06,049 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:06,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 05:50:06,049 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:06,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:06,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1225973267, now seen corresponding path program 1 times [2025-03-17 05:50:06,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:06,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163634463] [2025-03-17 05:50:06,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:06,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:06,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:50:06,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:50:06,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:06,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:06,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:06,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163634463] [2025-03-17 05:50:06,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163634463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:06,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:06,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:50:06,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189940901] [2025-03-17 05:50:06,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:06,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:50:06,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:06,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:50:06,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:50:06,693 INFO L87 Difference]: Start difference. First operand 650 states and 814 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:50:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:07,005 INFO L93 Difference]: Finished difference Result 692 states and 864 transitions. [2025-03-17 05:50:07,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:50:07,006 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2025-03-17 05:50:07,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:07,009 INFO L225 Difference]: With dead ends: 692 [2025-03-17 05:50:07,009 INFO L226 Difference]: Without dead ends: 690 [2025-03-17 05:50:07,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:50:07,010 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 177 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:07,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 631 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:50:07,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-17 05:50:07,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 634. [2025-03-17 05:50:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 532 states have (on average 1.1898496240601504) internal successors, (633), 539 states have internal predecessors, (633), 77 states have call successors, (77), 24 states have call predecessors, (77), 24 states have return successors, (77), 70 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-17 05:50:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 787 transitions. [2025-03-17 05:50:07,062 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 787 transitions. Word has length 148 [2025-03-17 05:50:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:07,062 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 787 transitions. [2025-03-17 05:50:07,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:50:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 787 transitions. [2025-03-17 05:50:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:50:07,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:07,065 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:07,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 05:50:07,065 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:07,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:07,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1226896788, now seen corresponding path program 1 times [2025-03-17 05:50:07,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:07,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025873539] [2025-03-17 05:50:07,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:07,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:07,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:50:07,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:50:07,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:07,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:07,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:07,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025873539] [2025-03-17 05:50:07,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025873539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:07,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:07,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:50:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153693418] [2025-03-17 05:50:07,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:07,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:50:07,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:07,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:50:07,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:50:07,186 INFO L87 Difference]: Start difference. First operand 634 states and 787 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:07,261 INFO L93 Difference]: Finished difference Result 1322 states and 1640 transitions. [2025-03-17 05:50:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:50:07,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-03-17 05:50:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:07,265 INFO L225 Difference]: With dead ends: 1322 [2025-03-17 05:50:07,265 INFO L226 Difference]: Without dead ends: 689 [2025-03-17 05:50:07,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:50:07,266 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 91 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:07,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 637 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:50:07,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-03-17 05:50:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 688. [2025-03-17 05:50:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 564 states have (on average 1.1648936170212767) internal successors, (657), 572 states have internal predecessors, (657), 94 states have call successors, (94), 29 states have call predecessors, (94), 29 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 05:50:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 845 transitions. [2025-03-17 05:50:07,339 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 845 transitions. Word has length 148 [2025-03-17 05:50:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:07,340 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 845 transitions. [2025-03-17 05:50:07,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 845 transitions. [2025-03-17 05:50:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:50:07,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:07,341 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:07,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 05:50:07,341 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:07,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:07,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2114400469, now seen corresponding path program 1 times [2025-03-17 05:50:07,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:07,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278933684] [2025-03-17 05:50:07,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:07,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:07,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:50:07,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:50:07,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:07,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 05:50:07,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:07,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278933684] [2025-03-17 05:50:07,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278933684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:50:07,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007578208] [2025-03-17 05:50:07,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:07,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:50:07,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:50:07,445 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:50:07,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:50:07,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:50:07,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:50:07,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:07,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:07,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:50:07,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:07,662 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:50:07,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007578208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:07,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:50:07,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:50:07,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547971647] [2025-03-17 05:50:07,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:07,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:50:07,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:07,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:50:07,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:50:07,663 INFO L87 Difference]: Start difference. First operand 688 states and 845 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:07,740 INFO L93 Difference]: Finished difference Result 1349 states and 1658 transitions. [2025-03-17 05:50:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:50:07,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-03-17 05:50:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:07,743 INFO L225 Difference]: With dead ends: 1349 [2025-03-17 05:50:07,743 INFO L226 Difference]: Without dead ends: 712 [2025-03-17 05:50:07,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:50:07,745 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 525 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-17 05:50:07,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 525 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:50:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-17 05:50:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2025-03-17 05:50:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 588 states have (on average 1.1581632653061225) internal successors, (681), 596 states have internal predecessors, (681), 94 states have call successors, (94), 29 states have call predecessors, (94), 29 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 05:50:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 869 transitions. [2025-03-17 05:50:07,839 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 869 transitions. Word has length 148 [2025-03-17 05:50:07,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:07,839 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 869 transitions. [2025-03-17 05:50:07,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 869 transitions. [2025-03-17 05:50:07,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 05:50:07,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:07,841 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:07,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:50:08,041 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,SelfDestructingSolverStorable38 [2025-03-17 05:50:08,042 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:08,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:08,042 INFO L85 PathProgramCache]: Analyzing trace with hash 669997527, now seen corresponding path program 1 times [2025-03-17 05:50:08,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:08,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021458670] [2025-03-17 05:50:08,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:08,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:08,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:50:08,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:50:08,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:08,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:08,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:08,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021458670] [2025-03-17 05:50:08,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021458670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:08,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:08,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:50:08,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632223973] [2025-03-17 05:50:08,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:08,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:50:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:08,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:50:08,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:50:08,626 INFO L87 Difference]: Start difference. First operand 712 states and 869 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:50:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:09,089 INFO L93 Difference]: Finished difference Result 1776 states and 2147 transitions. [2025-03-17 05:50:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:50:09,090 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-03-17 05:50:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:09,094 INFO L225 Difference]: With dead ends: 1776 [2025-03-17 05:50:09,094 INFO L226 Difference]: Without dead ends: 1115 [2025-03-17 05:50:09,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:50:09,095 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 233 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:09,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 611 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:50:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-17 05:50:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 881. [2025-03-17 05:50:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 757 states have (on average 1.1532364597093792) internal successors, (873), 765 states have internal predecessors, (873), 94 states have call successors, (94), 29 states have call predecessors, (94), 29 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 05:50:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1061 transitions. [2025-03-17 05:50:09,160 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1061 transitions. Word has length 150 [2025-03-17 05:50:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:09,160 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1061 transitions. [2025-03-17 05:50:09,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:50:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1061 transitions. [2025-03-17 05:50:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 05:50:09,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:09,162 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:09,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 05:50:09,162 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:09,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:09,162 INFO L85 PathProgramCache]: Analyzing trace with hash 376594520, now seen corresponding path program 1 times [2025-03-17 05:50:09,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:09,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600451196] [2025-03-17 05:50:09,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:09,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:50:09,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:50:09,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:09,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:09,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600451196] [2025-03-17 05:50:09,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600451196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:09,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:09,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:50:09,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569114556] [2025-03-17 05:50:09,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:09,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:50:09,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:09,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:50:09,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:50:09,482 INFO L87 Difference]: Start difference. First operand 881 states and 1061 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:50:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:09,823 INFO L93 Difference]: Finished difference Result 2106 states and 2515 transitions. [2025-03-17 05:50:09,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:50:09,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2025-03-17 05:50:09,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:09,828 INFO L225 Difference]: With dead ends: 2106 [2025-03-17 05:50:09,828 INFO L226 Difference]: Without dead ends: 1276 [2025-03-17 05:50:09,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:50:09,829 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 330 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:09,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 496 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:50:09,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2025-03-17 05:50:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1042. [2025-03-17 05:50:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 918 states have (on average 1.1339869281045751) internal successors, (1041), 926 states have internal predecessors, (1041), 94 states have call successors, (94), 29 states have call predecessors, (94), 29 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 05:50:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1229 transitions. [2025-03-17 05:50:09,894 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1229 transitions. Word has length 150 [2025-03-17 05:50:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:09,894 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1229 transitions. [2025-03-17 05:50:09,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:50:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1229 transitions. [2025-03-17 05:50:09,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 05:50:09,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:09,895 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:09,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-17 05:50:09,895 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:09,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:09,896 INFO L85 PathProgramCache]: Analyzing trace with hash 415260982, now seen corresponding path program 1 times [2025-03-17 05:50:09,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:09,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063179788] [2025-03-17 05:50:09,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:09,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:09,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:50:09,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:50:09,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:09,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:10,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:10,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063179788] [2025-03-17 05:50:10,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063179788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:10,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:10,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:50:10,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340203402] [2025-03-17 05:50:10,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:10,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:50:10,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:10,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:50:10,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:50:10,299 INFO L87 Difference]: Start difference. First operand 1042 states and 1229 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:50:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:10,620 INFO L93 Difference]: Finished difference Result 2267 states and 2667 transitions. [2025-03-17 05:50:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:50:10,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-03-17 05:50:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:10,625 INFO L225 Difference]: With dead ends: 2267 [2025-03-17 05:50:10,625 INFO L226 Difference]: Without dead ends: 1276 [2025-03-17 05:50:10,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:50:10,627 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 295 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:10,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 557 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:50:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2025-03-17 05:50:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1042. [2025-03-17 05:50:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 918 states have (on average 1.1252723311546842) internal successors, (1033), 926 states have internal predecessors, (1033), 94 states have call successors, (94), 29 states have call predecessors, (94), 29 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 05:50:10,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1221 transitions. [2025-03-17 05:50:10,694 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1221 transitions. Word has length 150 [2025-03-17 05:50:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:10,694 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1221 transitions. [2025-03-17 05:50:10,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:50:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1221 transitions. [2025-03-17 05:50:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 05:50:10,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:10,696 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:10,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-17 05:50:10,696 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:10,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash 121857975, now seen corresponding path program 1 times [2025-03-17 05:50:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:10,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744073896] [2025-03-17 05:50:10,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:10,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:50:10,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:50:10,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:10,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:11,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:11,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744073896] [2025-03-17 05:50:11,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744073896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:11,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:11,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:50:11,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518124270] [2025-03-17 05:50:11,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:11,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:50:11,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:11,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:50:11,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:50:11,252 INFO L87 Difference]: Start difference. First operand 1042 states and 1221 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2025-03-17 05:50:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:11,908 INFO L93 Difference]: Finished difference Result 2397 states and 2768 transitions. [2025-03-17 05:50:11,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:50:11,909 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) Word has length 150 [2025-03-17 05:50:11,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:11,913 INFO L225 Difference]: With dead ends: 2397 [2025-03-17 05:50:11,913 INFO L226 Difference]: Without dead ends: 1406 [2025-03-17 05:50:11,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:50:11,915 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 168 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:11,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 860 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:50:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-03-17 05:50:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1320. [2025-03-17 05:50:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1166 states have (on average 1.1003430531732419) internal successors, (1283), 1179 states have internal predecessors, (1283), 114 states have call successors, (114), 39 states have call predecessors, (114), 39 states have return successors, (114), 101 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-17 05:50:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1511 transitions. [2025-03-17 05:50:12,011 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1511 transitions. Word has length 150 [2025-03-17 05:50:12,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:12,011 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1511 transitions. [2025-03-17 05:50:12,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2025-03-17 05:50:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1511 transitions. [2025-03-17 05:50:12,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:50:12,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:12,012 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:12,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-17 05:50:12,012 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:12,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:12,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1985917008, now seen corresponding path program 1 times [2025-03-17 05:50:12,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:12,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562700739] [2025-03-17 05:50:12,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:12,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:12,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:50:12,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:50:12,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:12,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:12,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:12,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562700739] [2025-03-17 05:50:12,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562700739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:12,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:12,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:50:12,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855935399] [2025-03-17 05:50:12,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:12,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:50:12,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:12,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:50:12,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:50:12,255 INFO L87 Difference]: Start difference. First operand 1320 states and 1511 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:12,487 INFO L93 Difference]: Finished difference Result 3848 states and 4396 transitions. [2025-03-17 05:50:12,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:50:12,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-17 05:50:12,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:12,498 INFO L225 Difference]: With dead ends: 3848 [2025-03-17 05:50:12,498 INFO L226 Difference]: Without dead ends: 1352 [2025-03-17 05:50:12,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:50:12,503 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 117 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:12,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1388 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:50:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-03-17 05:50:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1328. [2025-03-17 05:50:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1174 states have (on average 1.0775127768313457) internal successors, (1265), 1187 states have internal predecessors, (1265), 114 states have call successors, (114), 39 states have call predecessors, (114), 39 states have return successors, (114), 101 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-17 05:50:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1493 transitions. [2025-03-17 05:50:12,620 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1493 transitions. Word has length 151 [2025-03-17 05:50:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:12,620 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 1493 transitions. [2025-03-17 05:50:12,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1493 transitions. [2025-03-17 05:50:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:50:12,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:12,622 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:12,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-17 05:50:12,622 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:12,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:12,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1347436271, now seen corresponding path program 1 times [2025-03-17 05:50:12,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:12,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748591875] [2025-03-17 05:50:12,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:12,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:12,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:50:12,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:50:12,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:12,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:50:12,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [238456821] [2025-03-17 05:50:12,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:12,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:50:12,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:50:12,745 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:50:12,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:50:12,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:50:13,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:50:13,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:13,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:13,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-17 05:50:13,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:13,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:50:13,589 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 23 treesize of output 3 [2025-03-17 05:50:13,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:50:13,848 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 51 treesize of output 43 [2025-03-17 05:50:13,856 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 54 treesize of output 34 [2025-03-17 05:50:13,864 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 35 treesize of output 27 [2025-03-17 05:50:13,870 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 31 treesize of output 23 [2025-03-17 05:50:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 504 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:50:13,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:50:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:50:15,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:15,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748591875] [2025-03-17 05:50:15,168 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:50:15,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238456821] [2025-03-17 05:50:15,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238456821] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:50:15,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:50:15,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2025-03-17 05:50:15,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115507080] [2025-03-17 05:50:15,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:15,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:50:15,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:15,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:50:15,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:50:15,169 INFO L87 Difference]: Start difference. First operand 1328 states and 1493 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:16,281 INFO L93 Difference]: Finished difference Result 2743 states and 3060 transitions. [2025-03-17 05:50:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:50:16,282 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-17 05:50:16,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:16,284 INFO L225 Difference]: With dead ends: 2743 [2025-03-17 05:50:16,284 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 05:50:16,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 291 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:50:16,289 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 82 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:16,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 394 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:50:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 05:50:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 05:50:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 05:50:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 05:50:16,291 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 151 [2025-03-17 05:50:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:16,291 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 05:50:16,292 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:50:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 05:50:16,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 05:50:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:50:16,303 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-17 05:50:16,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:50:16,497 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, 1, 1, 1] [2025-03-17 05:50:16,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 05:50:46,637 WARN L286 SmtUtils]: Spent 29.65s on a formula simplification. DAG size of input: 208 DAG size of output: 241 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)