./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-85.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-85.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 5e929c4003dd56b80bb766773f31b5c9376f023636b5de2c888cd8fd3433b56e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:51:16,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:51:16,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:51:16,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:51:16,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:51:16,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:51:16,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:51:16,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:51:16,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:51:16,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:51:16,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:51:16,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:51:16,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:51:16,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:51:16,569 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:51:16,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:51:16,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:51:16,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:51:16,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:51:16,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:51:16,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:51:16,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:51:16,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:51:16,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:51:16,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:51:16,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:51:16,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:51:16,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:51:16,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:51:16,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:51:16,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:51:16,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:51:16,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:51:16,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:51:16,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:51:16,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:51:16,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:51:16,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:51:16,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:51:16,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:51:16,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:51:16,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:51:16,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:51:16,573 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 -> 5e929c4003dd56b80bb766773f31b5c9376f023636b5de2c888cd8fd3433b56e [2025-03-17 05:51:16,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:51:16,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:51:16,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:51:16,855 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:51:16,855 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:51:16,857 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-85.i [2025-03-17 05:51:18,093 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90241530b/1f273df95dfa4a46bb300308feddd362/FLAG570eebac9 [2025-03-17 05:51:18,373 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:51:18,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-85.i [2025-03-17 05:51:18,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90241530b/1f273df95dfa4a46bb300308feddd362/FLAG570eebac9 [2025-03-17 05:51:18,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90241530b/1f273df95dfa4a46bb300308feddd362 [2025-03-17 05:51:18,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:51:18,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:51:18,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:51:18,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:51:18,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:51:18,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:51:18" (1/1) ... [2025-03-17 05:51:18,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b62cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:18, skipping insertion in model container [2025-03-17 05:51:18,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:51:18" (1/1) ... [2025-03-17 05:51:18,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:51:18,826 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-85.i[916,929] [2025-03-17 05:51:18,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:51:18,907 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:51:18,915 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-85.i[916,929] [2025-03-17 05:51:18,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:51:18,961 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:51:18,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:18 WrapperNode [2025-03-17 05:51:18,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:51:18,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:51:18,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:51:18,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:51:18,967 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:51:18" (1/1) ... [2025-03-17 05:51:18,976 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:51:18" (1/1) ... [2025-03-17 05:51:19,004 INFO L138 Inliner]: procedures = 26, calls = 190, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 558 [2025-03-17 05:51:19,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:51:19,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:51:19,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:51:19,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:51:19,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:18" (1/1) ... [2025-03-17 05:51:19,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:18" (1/1) ... [2025-03-17 05:51:19,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:18" (1/1) ... [2025-03-17 05:51:19,039 INFO L175 MemorySlicer]: Split 139 memory accesses to 18 slices as follows [2, 7, 15, 14, 5, 8, 10, 6, 8, 5, 6, 6, 6, 9, 10, 6, 9, 7]. 11 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 22 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1]. [2025-03-17 05:51:19,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:18" (1/1) ... [2025-03-17 05:51:19,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:18" (1/1) ... [2025-03-17 05:51:19,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:18" (1/1) ... [2025-03-17 05:51:19,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:18" (1/1) ... [2025-03-17 05:51:19,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:18" (1/1) ... [2025-03-17 05:51:19,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:18" (1/1) ... [2025-03-17 05:51:19,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:51:19,076 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:51:19,076 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:51:19,076 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:51:19,077 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:18" (1/1) ... [2025-03-17 05:51:19,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:51:19,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:19,103 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:51:19,107 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:51:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:51:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:51:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:51:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:51:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:51:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:51:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:51:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:51:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:51:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:51:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:51:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:51:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:51:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 05:51:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 05:51:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-17 05:51:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-17 05:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-17 05:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-17 05:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:51:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:51:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:51:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:51:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:51:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:51:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 05:51:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 05:51:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:51:19,128 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-17 05:51:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-17 05:51:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-17 05:51:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:51:19,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:51:19,274 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:51:19,276 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:51:19,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~mem80#1;havoc property_#t~ite93#1;havoc property_#t~mem86#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem101#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~short102#1;havoc property_#t~mem110#1;havoc property_#t~mem106#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short105#1;havoc property_#t~short107#1;havoc property_#t~mem108#1;havoc property_#t~short109#1;havoc property_#t~short111#1;havoc property_#t~mem117#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~short116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite127#1;havoc property_#t~mem123#1;havoc property_#t~mem120#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite141#1;havoc property_#t~mem133#1;havoc property_#t~ite138#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short142#1; [2025-03-17 05:51:19,773 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-03-17 05:51:19,773 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:51:19,783 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:51:19,784 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:51:19,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:51:19 BoogieIcfgContainer [2025-03-17 05:51:19,784 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:51:19,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:51:19,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:51:19,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:51:19,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:51:18" (1/3) ... [2025-03-17 05:51:19,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1d2d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:51:19, skipping insertion in model container [2025-03-17 05:51:19,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:18" (2/3) ... [2025-03-17 05:51:19,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1d2d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:51:19, skipping insertion in model container [2025-03-17 05:51:19,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:51:19" (3/3) ... [2025-03-17 05:51:19,793 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-85.i [2025-03-17 05:51:19,804 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:51:19,805 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-85.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:51:19,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:51:19,865 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;@1d08ca3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:51:19,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:51:19,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 99 states have (on average 1.393939393939394) internal successors, (138), 100 states have internal predecessors, (138), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:51:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 05:51:19,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:19,884 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:19,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:19,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:19,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1324627822, now seen corresponding path program 1 times [2025-03-17 05:51:19,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:19,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008944685] [2025-03-17 05:51:19,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:19,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:19,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 05:51:20,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 05:51:20,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:20,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-17 05:51:20,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:20,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008944685] [2025-03-17 05:51:20,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008944685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:20,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492018139] [2025-03-17 05:51:20,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:20,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:20,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:20,215 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:51:20,216 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:51:20,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 05:51:20,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 05:51:20,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:20,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:20,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:51:20,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-17 05:51:20,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:51:20,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492018139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:20,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:20,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:51:20,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630907071] [2025-03-17 05:51:20,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:20,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:51:20,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:20,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:51:20,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:51:20,553 INFO L87 Difference]: Start difference. First operand has 125 states, 99 states have (on average 1.393939393939394) internal successors, (138), 100 states have internal predecessors, (138), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 05:51:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:20,576 INFO L93 Difference]: Finished difference Result 247 states and 389 transitions. [2025-03-17 05:51:20,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:51:20,578 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2025-03-17 05:51:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:20,583 INFO L225 Difference]: With dead ends: 247 [2025-03-17 05:51:20,583 INFO L226 Difference]: Without dead ends: 123 [2025-03-17 05:51:20,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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:51:20,588 INFO L435 NwaCegarLoop]: 180 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, 180 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:51:20,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-17 05:51:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-17 05:51:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:51:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2025-03-17 05:51:20,639 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 175 [2025-03-17 05:51:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:20,640 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2025-03-17 05:51:20,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 05:51:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2025-03-17 05:51:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 05:51:20,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:20,644 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:20,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:51:20,847 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:51:20,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:20,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1460925015, now seen corresponding path program 1 times [2025-03-17 05:51:20,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:20,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674332103] [2025-03-17 05:51:20,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:20,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:20,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 05:51:20,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 05:51:20,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:20,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:21,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:21,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:21,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674332103] [2025-03-17 05:51:21,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674332103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:21,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:21,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:51:21,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129035208] [2025-03-17 05:51:21,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:21,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:51:21,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:21,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:51:21,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:51:21,200 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:21,274 INFO L93 Difference]: Finished difference Result 248 states and 363 transitions. [2025-03-17 05:51:21,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:51:21,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2025-03-17 05:51:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:21,278 INFO L225 Difference]: With dead ends: 248 [2025-03-17 05:51:21,279 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 05:51:21,280 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:51:21,282 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:21,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 522 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 05:51:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2025-03-17 05:51:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.36) internal successors, (136), 100 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:51:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2025-03-17 05:51:21,294 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 182 transitions. Word has length 175 [2025-03-17 05:51:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:21,296 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 182 transitions. [2025-03-17 05:51:21,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 182 transitions. [2025-03-17 05:51:21,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 05:51:21,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:21,298 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:21,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:51:21,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:21,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1449608888, now seen corresponding path program 1 times [2025-03-17 05:51:21,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:21,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142785876] [2025-03-17 05:51:21,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:21,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:21,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 05:51:21,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 05:51:21,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:21,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:21,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:21,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142785876] [2025-03-17 05:51:21,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142785876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:21,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:21,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:51:21,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21271003] [2025-03-17 05:51:21,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:21,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:51:21,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:21,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:51:21,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:51:21,520 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:21,556 INFO L93 Difference]: Finished difference Result 252 states and 367 transitions. [2025-03-17 05:51:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:51:21,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2025-03-17 05:51:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:21,559 INFO L225 Difference]: With dead ends: 252 [2025-03-17 05:51:21,560 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 05:51:21,561 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:51:21,562 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 523 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:51:21,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:21,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 05:51:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2025-03-17 05:51:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:51:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 184 transitions. [2025-03-17 05:51:21,578 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 184 transitions. Word has length 175 [2025-03-17 05:51:21,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:21,579 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 184 transitions. [2025-03-17 05:51:21,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 184 transitions. [2025-03-17 05:51:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 05:51:21,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:21,583 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:21,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:51:21,583 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:21,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1418589081, now seen corresponding path program 1 times [2025-03-17 05:51:21,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:21,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398616833] [2025-03-17 05:51:21,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:21,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:21,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 05:51:21,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 05:51:21,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:21,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:21,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:21,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:21,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398616833] [2025-03-17 05:51:21,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398616833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:21,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:21,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:21,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954713232] [2025-03-17 05:51:21,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:21,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:21,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:21,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:21,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:21,997 INFO L87 Difference]: Start difference. First operand 127 states and 184 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:22,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:22,209 INFO L93 Difference]: Finished difference Result 372 states and 539 transitions. [2025-03-17 05:51:22,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:22,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2025-03-17 05:51:22,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:22,212 INFO L225 Difference]: With dead ends: 372 [2025-03-17 05:51:22,212 INFO L226 Difference]: Without dead ends: 246 [2025-03-17 05:51:22,212 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:51:22,213 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 165 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:22,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 939 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:51:22,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-17 05:51:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 129. [2025-03-17 05:51:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:51:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2025-03-17 05:51:22,230 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 175 [2025-03-17 05:51:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:22,230 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2025-03-17 05:51:22,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2025-03-17 05:51:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 05:51:22,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:22,233 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:22,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:51:22,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:22,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:22,234 INFO L85 PathProgramCache]: Analyzing trace with hash -607214357, now seen corresponding path program 1 times [2025-03-17 05:51:22,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:22,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441437539] [2025-03-17 05:51:22,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:22,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:22,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 05:51:22,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 05:51:22,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:22,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:23,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:23,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441437539] [2025-03-17 05:51:23,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441437539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:23,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:23,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:51:23,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986748291] [2025-03-17 05:51:23,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:23,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:51:23,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:23,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:51:23,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:23,156 INFO L87 Difference]: Start difference. First operand 129 states and 186 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-17 05:51:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:23,629 INFO L93 Difference]: Finished difference Result 478 states and 685 transitions. [2025-03-17 05:51:23,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:51:23,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 175 [2025-03-17 05:51:23,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:23,632 INFO L225 Difference]: With dead ends: 478 [2025-03-17 05:51:23,632 INFO L226 Difference]: Without dead ends: 350 [2025-03-17 05:51:23,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:51:23,633 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 1023 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:23,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 943 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:51:23,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-17 05:51:23,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 202. [2025-03-17 05:51:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 175 states have internal predecessors, (240), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 290 transitions. [2025-03-17 05:51:23,657 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 290 transitions. Word has length 175 [2025-03-17 05:51:23,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:23,657 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 290 transitions. [2025-03-17 05:51:23,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-17 05:51:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 290 transitions. [2025-03-17 05:51:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 05:51:23,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:23,659 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:23,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:51:23,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:23,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash 192117737, now seen corresponding path program 1 times [2025-03-17 05:51:23,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:23,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218184430] [2025-03-17 05:51:23,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:23,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:23,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 05:51:23,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 05:51:23,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:23,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:24,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:24,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218184430] [2025-03-17 05:51:24,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218184430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:24,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:24,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:51:24,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299439425] [2025-03-17 05:51:24,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:24,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:51:24,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:24,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:51:24,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:24,190 INFO L87 Difference]: Start difference. First operand 202 states and 290 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:24,297 INFO L93 Difference]: Finished difference Result 557 states and 798 transitions. [2025-03-17 05:51:24,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:51:24,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-17 05:51:24,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:24,300 INFO L225 Difference]: With dead ends: 557 [2025-03-17 05:51:24,301 INFO L226 Difference]: Without dead ends: 356 [2025-03-17 05:51:24,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:24,303 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 142 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1169 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.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:24,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1169 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-17 05:51:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 214. [2025-03-17 05:51:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 186 states have (on average 1.3655913978494623) internal successors, (254), 187 states have internal predecessors, (254), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 304 transitions. [2025-03-17 05:51:24,326 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 304 transitions. Word has length 176 [2025-03-17 05:51:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:24,326 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 304 transitions. [2025-03-17 05:51:24,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 304 transitions. [2025-03-17 05:51:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 05:51:24,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:24,328 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:24,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:51:24,329 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:24,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:24,329 INFO L85 PathProgramCache]: Analyzing trace with hash -318416440, now seen corresponding path program 1 times [2025-03-17 05:51:24,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:24,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112629248] [2025-03-17 05:51:24,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:24,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:24,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 05:51:24,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 05:51:24,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:24,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112629248] [2025-03-17 05:51:24,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112629248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:24,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:24,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:51:24,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628890233] [2025-03-17 05:51:24,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:24,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:51:24,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:24,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:51:24,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:24,663 INFO L87 Difference]: Start difference. First operand 214 states and 304 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:24,832 INFO L93 Difference]: Finished difference Result 560 states and 798 transitions. [2025-03-17 05:51:24,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:51:24,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-17 05:51:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:24,835 INFO L225 Difference]: With dead ends: 560 [2025-03-17 05:51:24,835 INFO L226 Difference]: Without dead ends: 347 [2025-03-17 05:51:24,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:51:24,836 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 164 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:24,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1163 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:24,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-17 05:51:24,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 236. [2025-03-17 05:51:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 208 states have (on average 1.3557692307692308) internal successors, (282), 209 states have internal predecessors, (282), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 332 transitions. [2025-03-17 05:51:24,855 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 332 transitions. Word has length 176 [2025-03-17 05:51:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:24,856 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 332 transitions. [2025-03-17 05:51:24,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 332 transitions. [2025-03-17 05:51:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 05:51:24,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:24,857 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:24,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:51:24,858 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:24,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:24,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1349765852, now seen corresponding path program 1 times [2025-03-17 05:51:24,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:24,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226576340] [2025-03-17 05:51:24,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:24,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:24,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 05:51:24,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 05:51:24,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:24,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:51:25,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:25,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226576340] [2025-03-17 05:51:25,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226576340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:25,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649239622] [2025-03-17 05:51:25,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:25,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:25,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:25,316 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:51:25,318 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:51:25,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 05:51:25,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 05:51:25,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:25,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:25,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:51:25,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:25,616 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 11 treesize of output 7 [2025-03-17 05:51:25,680 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 17 treesize of output 13 [2025-03-17 05:51:25,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-17 05:51:25,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 05:51:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:25,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:51:25,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649239622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:25,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:25,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2025-03-17 05:51:25,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743358831] [2025-03-17 05:51:25,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:25,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:51:25,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:25,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:51:25,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:51:25,805 INFO L87 Difference]: Start difference. First operand 236 states and 332 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:26,324 INFO L93 Difference]: Finished difference Result 910 states and 1282 transitions. [2025-03-17 05:51:26,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:51:26,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-17 05:51:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:26,328 INFO L225 Difference]: With dead ends: 910 [2025-03-17 05:51:26,328 INFO L226 Difference]: Without dead ends: 675 [2025-03-17 05:51:26,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:51:26,329 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 415 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:26,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1978 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:51:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-17 05:51:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 307. [2025-03-17 05:51:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 279 states have (on average 1.3799283154121864) internal successors, (385), 280 states have internal predecessors, (385), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 435 transitions. [2025-03-17 05:51:26,353 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 435 transitions. Word has length 176 [2025-03-17 05:51:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:26,353 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 435 transitions. [2025-03-17 05:51:26,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 435 transitions. [2025-03-17 05:51:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 05:51:26,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:26,355 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:26,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:51:26,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-17 05:51:26,556 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:26,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:26,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1860300029, now seen corresponding path program 1 times [2025-03-17 05:51:26,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:26,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418218260] [2025-03-17 05:51:26,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:26,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:26,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 05:51:26,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 05:51:26,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:26,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:26,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:26,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418218260] [2025-03-17 05:51:26,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418218260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:26,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:26,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:51:26,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368861420] [2025-03-17 05:51:26,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:26,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:51:26,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:26,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:51:26,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:51:26,903 INFO L87 Difference]: Start difference. First operand 307 states and 435 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:27,217 INFO L93 Difference]: Finished difference Result 979 states and 1381 transitions. [2025-03-17 05:51:27,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:51:27,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-17 05:51:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:27,221 INFO L225 Difference]: With dead ends: 979 [2025-03-17 05:51:27,221 INFO L226 Difference]: Without dead ends: 673 [2025-03-17 05:51:27,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:51:27,222 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 408 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:27,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1316 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:51:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-17 05:51:27,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 307. [2025-03-17 05:51:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 279 states have (on average 1.3727598566308243) internal successors, (383), 280 states have internal predecessors, (383), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 433 transitions. [2025-03-17 05:51:27,264 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 433 transitions. Word has length 176 [2025-03-17 05:51:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:27,265 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 433 transitions. [2025-03-17 05:51:27,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 433 transitions. [2025-03-17 05:51:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 05:51:27,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:27,267 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:27,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:51:27,267 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:27,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:27,268 INFO L85 PathProgramCache]: Analyzing trace with hash -538391128, now seen corresponding path program 1 times [2025-03-17 05:51:27,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:27,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151708501] [2025-03-17 05:51:27,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:27,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:27,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 05:51:27,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 05:51:27,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:27,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:27,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151708501] [2025-03-17 05:51:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151708501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:27,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:27,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:27,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736060023] [2025-03-17 05:51:27,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:27,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:27,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:27,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:27,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:27,462 INFO L87 Difference]: Start difference. First operand 307 states and 433 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:27,618 INFO L93 Difference]: Finished difference Result 845 states and 1199 transitions. [2025-03-17 05:51:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-17 05:51:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:27,621 INFO L225 Difference]: With dead ends: 845 [2025-03-17 05:51:27,621 INFO L226 Difference]: Without dead ends: 539 [2025-03-17 05:51:27,622 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:51:27,623 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 165 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:27,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 651 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-17 05:51:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 296. [2025-03-17 05:51:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 268 states have (on average 1.3582089552238805) internal successors, (364), 269 states have internal predecessors, (364), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 414 transitions. [2025-03-17 05:51:27,646 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 414 transitions. Word has length 176 [2025-03-17 05:51:27,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:27,647 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 414 transitions. [2025-03-17 05:51:27,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 414 transitions. [2025-03-17 05:51:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 05:51:27,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:27,649 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:27,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:51:27,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:27,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:27,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1758590077, now seen corresponding path program 1 times [2025-03-17 05:51:27,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:27,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475497181] [2025-03-17 05:51:27,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:27,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:27,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 05:51:27,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 05:51:27,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:27,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:27,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:27,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475497181] [2025-03-17 05:51:27,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475497181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:27,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:27,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:51:27,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368266469] [2025-03-17 05:51:27,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:27,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:51:27,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:27,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:51:27,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:51:27,969 INFO L87 Difference]: Start difference. First operand 296 states and 414 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:28,342 INFO L93 Difference]: Finished difference Result 940 states and 1317 transitions. [2025-03-17 05:51:28,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:51:28,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-17 05:51:28,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:28,345 INFO L225 Difference]: With dead ends: 940 [2025-03-17 05:51:28,345 INFO L226 Difference]: Without dead ends: 645 [2025-03-17 05:51:28,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:51:28,346 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 401 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:28,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1105 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:51:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-17 05:51:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 304. [2025-03-17 05:51:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 276 states have (on average 1.3478260869565217) internal successors, (372), 277 states have internal predecessors, (372), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2025-03-17 05:51:28,372 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 176 [2025-03-17 05:51:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:28,372 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2025-03-17 05:51:28,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2025-03-17 05:51:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 05:51:28,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:28,374 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:28,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:51:28,374 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:28,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:28,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2025843042, now seen corresponding path program 1 times [2025-03-17 05:51:28,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:28,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159166087] [2025-03-17 05:51:28,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:28,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:28,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 05:51:28,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 05:51:28,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:28,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:51:28,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:28,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159166087] [2025-03-17 05:51:28,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159166087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:28,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6878427] [2025-03-17 05:51:28,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:28,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:28,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:28,753 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:51:28,755 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:51:28,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 05:51:28,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 05:51:28,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:28,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:28,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:51:28,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:29,004 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 11 treesize of output 9 [2025-03-17 05:51:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:29,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:51:29,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6878427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:29,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:29,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2025-03-17 05:51:29,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262696430] [2025-03-17 05:51:29,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:29,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:51:29,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:29,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:51:29,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:51:29,069 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:29,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:29,214 INFO L93 Difference]: Finished difference Result 887 states and 1241 transitions. [2025-03-17 05:51:29,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:51:29,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-17 05:51:29,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:29,217 INFO L225 Difference]: With dead ends: 887 [2025-03-17 05:51:29,218 INFO L226 Difference]: Without dead ends: 584 [2025-03-17 05:51:29,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:51:29,219 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 175 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:29,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1867 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:29,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-17 05:51:29,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 312. [2025-03-17 05:51:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 284 states have (on average 1.3450704225352113) internal successors, (382), 285 states have internal predecessors, (382), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:29,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 432 transitions. [2025-03-17 05:51:29,243 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 432 transitions. Word has length 176 [2025-03-17 05:51:29,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:29,243 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 432 transitions. [2025-03-17 05:51:29,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 432 transitions. [2025-03-17 05:51:29,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 05:51:29,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:29,245 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:29,253 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:51:29,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:29,446 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:29,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:29,447 INFO L85 PathProgramCache]: Analyzing trace with hash -996730451, now seen corresponding path program 1 times [2025-03-17 05:51:29,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:29,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642486001] [2025-03-17 05:51:29,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:29,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:29,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 05:51:29,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 05:51:29,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:29,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:29,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:29,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642486001] [2025-03-17 05:51:29,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642486001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:29,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:29,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:51:29,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281557670] [2025-03-17 05:51:29,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:29,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:51:29,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:29,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:51:29,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:29,759 INFO L87 Difference]: Start difference. First operand 312 states and 432 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:29,963 INFO L93 Difference]: Finished difference Result 784 states and 1089 transitions. [2025-03-17 05:51:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:51:29,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2025-03-17 05:51:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:29,966 INFO L225 Difference]: With dead ends: 784 [2025-03-17 05:51:29,966 INFO L226 Difference]: Without dead ends: 473 [2025-03-17 05:51:29,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:51:29,967 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 315 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:29,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 943 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:51:29,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-17 05:51:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 309. [2025-03-17 05:51:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 281 states have (on average 1.3451957295373667) internal successors, (378), 282 states have internal predecessors, (378), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 428 transitions. [2025-03-17 05:51:29,987 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 428 transitions. Word has length 177 [2025-03-17 05:51:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:29,987 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 428 transitions. [2025-03-17 05:51:29,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 428 transitions. [2025-03-17 05:51:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 05:51:29,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:29,989 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:29,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:51:29,989 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:29,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:29,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1330668145, now seen corresponding path program 1 times [2025-03-17 05:51:29,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:29,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126312233] [2025-03-17 05:51:29,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:29,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:30,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 05:51:30,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 05:51:30,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:30,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:30,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:30,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:30,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126312233] [2025-03-17 05:51:30,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126312233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:30,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:30,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:51:30,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166408629] [2025-03-17 05:51:30,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:30,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:51:30,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:30,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:51:30,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:30,272 INFO L87 Difference]: Start difference. First operand 309 states and 428 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:30,486 INFO L93 Difference]: Finished difference Result 733 states and 1019 transitions. [2025-03-17 05:51:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:51:30,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2025-03-17 05:51:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:30,489 INFO L225 Difference]: With dead ends: 733 [2025-03-17 05:51:30,489 INFO L226 Difference]: Without dead ends: 425 [2025-03-17 05:51:30,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:51:30,490 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 406 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:30,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 626 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:51:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-17 05:51:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 309. [2025-03-17 05:51:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 282 states have internal predecessors, (377), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 427 transitions. [2025-03-17 05:51:30,511 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 427 transitions. Word has length 177 [2025-03-17 05:51:30,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:30,511 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 427 transitions. [2025-03-17 05:51:30,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 427 transitions. [2025-03-17 05:51:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 05:51:30,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:30,513 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:30,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:51:30,513 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:30,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1841202322, now seen corresponding path program 1 times [2025-03-17 05:51:30,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:30,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559263960] [2025-03-17 05:51:30,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:30,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:30,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 05:51:30,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 05:51:30,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:30,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:51:30,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559263960] [2025-03-17 05:51:30,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559263960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779928498] [2025-03-17 05:51:30,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:30,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:30,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:30,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:30,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:51:30,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 05:51:31,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 05:51:31,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:31,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:31,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:51:31,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:31,093 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 11 treesize of output 7 [2025-03-17 05:51:31,128 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 11 treesize of output 7 [2025-03-17 05:51:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:31,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:51:31,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779928498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:31,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:31,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-03-17 05:51:31,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076681898] [2025-03-17 05:51:31,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:31,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:51:31,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:31,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:51:31,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:51:31,200 INFO L87 Difference]: Start difference. First operand 309 states and 427 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:31,514 INFO L93 Difference]: Finished difference Result 934 states and 1299 transitions. [2025-03-17 05:51:31,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:51:31,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2025-03-17 05:51:31,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:31,518 INFO L225 Difference]: With dead ends: 934 [2025-03-17 05:51:31,518 INFO L226 Difference]: Without dead ends: 626 [2025-03-17 05:51:31,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:51:31,520 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 328 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:31,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 2510 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:51:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-17 05:51:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 313. [2025-03-17 05:51:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 285 states have (on average 1.3403508771929824) internal successors, (382), 286 states have internal predecessors, (382), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 432 transitions. [2025-03-17 05:51:31,547 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 432 transitions. Word has length 177 [2025-03-17 05:51:31,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:31,548 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 432 transitions. [2025-03-17 05:51:31,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 432 transitions. [2025-03-17 05:51:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-17 05:51:31,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:31,550 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:31,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:51:31,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 05:51:31,751 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:31,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:31,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1722802206, now seen corresponding path program 1 times [2025-03-17 05:51:31,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:31,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339825609] [2025-03-17 05:51:31,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:31,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:31,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 05:51:31,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 05:51:31,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:31,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:31,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:31,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339825609] [2025-03-17 05:51:31,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339825609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:31,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:31,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:51:31,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136398481] [2025-03-17 05:51:31,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:31,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:51:31,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:31,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:51:31,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:51:31,814 INFO L87 Difference]: Start difference. First operand 313 states and 432 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:31,834 INFO L93 Difference]: Finished difference Result 626 states and 865 transitions. [2025-03-17 05:51:31,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:51:31,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-03-17 05:51:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:31,836 INFO L225 Difference]: With dead ends: 626 [2025-03-17 05:51:31,836 INFO L226 Difference]: Without dead ends: 314 [2025-03-17 05:51:31,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:51:31,838 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:31,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:31,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-17 05:51:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-03-17 05:51:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 286 states have (on average 1.3391608391608392) internal successors, (383), 287 states have internal predecessors, (383), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 433 transitions. [2025-03-17 05:51:31,854 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 433 transitions. Word has length 178 [2025-03-17 05:51:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:31,854 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 433 transitions. [2025-03-17 05:51:31,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:31,854 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 433 transitions. [2025-03-17 05:51:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-17 05:51:31,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:31,856 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:31,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:51:31,856 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:31,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:31,857 INFO L85 PathProgramCache]: Analyzing trace with hash -89998207, now seen corresponding path program 1 times [2025-03-17 05:51:31,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:31,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737475203] [2025-03-17 05:51:31,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:31,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 05:51:31,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 05:51:31,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:31,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:31,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:31,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737475203] [2025-03-17 05:51:31,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737475203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:31,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:31,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:31,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549678047] [2025-03-17 05:51:31,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:31,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:31,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:31,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:31,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:31,983 INFO L87 Difference]: Start difference. First operand 314 states and 433 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:32,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:32,058 INFO L93 Difference]: Finished difference Result 794 states and 1092 transitions. [2025-03-17 05:51:32,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:32,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-03-17 05:51:32,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:32,061 INFO L225 Difference]: With dead ends: 794 [2025-03-17 05:51:32,061 INFO L226 Difference]: Without dead ends: 481 [2025-03-17 05:51:32,061 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:51:32,062 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 103 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:32,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 814 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-17 05:51:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 314. [2025-03-17 05:51:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 286 states have (on average 1.3356643356643356) internal successors, (382), 287 states have internal predecessors, (382), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 432 transitions. [2025-03-17 05:51:32,080 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 432 transitions. Word has length 178 [2025-03-17 05:51:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:32,080 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 432 transitions. [2025-03-17 05:51:32,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 432 transitions. [2025-03-17 05:51:32,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-17 05:51:32,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:32,082 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:32,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:51:32,082 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:32,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:32,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1860302048, now seen corresponding path program 1 times [2025-03-17 05:51:32,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:32,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973565631] [2025-03-17 05:51:32,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:32,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 05:51:32,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 05:51:32,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:32,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:32,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973565631] [2025-03-17 05:51:32,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973565631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:32,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:32,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:51:32,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978167025] [2025-03-17 05:51:32,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:32,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:51:32,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:32,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:51:32,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:51:32,211 INFO L87 Difference]: Start difference. First operand 314 states and 432 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:32,246 INFO L93 Difference]: Finished difference Result 541 states and 744 transitions. [2025-03-17 05:51:32,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:51:32,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-03-17 05:51:32,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:32,248 INFO L225 Difference]: With dead ends: 541 [2025-03-17 05:51:32,248 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 05:51:32,249 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:51:32,250 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:32,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 501 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 05:51:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2025-03-17 05:51:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 199 states have (on average 1.3115577889447236) internal successors, (261), 200 states have internal predecessors, (261), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 311 transitions. [2025-03-17 05:51:32,265 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 311 transitions. Word has length 178 [2025-03-17 05:51:32,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:32,265 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 311 transitions. [2025-03-17 05:51:32,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 311 transitions. [2025-03-17 05:51:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-17 05:51:32,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:32,267 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:32,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:51:32,267 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:32,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2118286786, now seen corresponding path program 1 times [2025-03-17 05:51:32,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:32,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007452792] [2025-03-17 05:51:32,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:32,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:32,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 05:51:32,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 05:51:32,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:32,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:32,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:32,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007452792] [2025-03-17 05:51:32,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007452792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:32,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:32,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:51:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552730609] [2025-03-17 05:51:32,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:32,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:51:32,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:32,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:51:32,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:51:32,602 INFO L87 Difference]: Start difference. First operand 227 states and 311 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:32,712 INFO L93 Difference]: Finished difference Result 513 states and 706 transitions. [2025-03-17 05:51:32,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:51:32,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2025-03-17 05:51:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:32,714 INFO L225 Difference]: With dead ends: 513 [2025-03-17 05:51:32,714 INFO L226 Difference]: Without dead ends: 287 [2025-03-17 05:51:32,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:51:32,715 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 162 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1462 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:51:32,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1462 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:32,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-17 05:51:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 233. [2025-03-17 05:51:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 205 states have (on average 1.302439024390244) internal successors, (267), 206 states have internal predecessors, (267), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 317 transitions. [2025-03-17 05:51:32,731 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 317 transitions. Word has length 179 [2025-03-17 05:51:32,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:32,731 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 317 transitions. [2025-03-17 05:51:32,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 317 transitions. [2025-03-17 05:51:32,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 05:51:32,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:32,733 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:32,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:51:32,733 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:32,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:32,733 INFO L85 PathProgramCache]: Analyzing trace with hash 844177312, now seen corresponding path program 1 times [2025-03-17 05:51:32,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:32,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671382159] [2025-03-17 05:51:32,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:32,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:32,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 05:51:32,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 05:51:32,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:32,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:32,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:32,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671382159] [2025-03-17 05:51:32,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671382159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:32,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:32,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:51:32,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481175342] [2025-03-17 05:51:32,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:32,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:51:32,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:32,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:51:32,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:51:32,792 INFO L87 Difference]: Start difference. First operand 233 states and 317 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:32,811 INFO L93 Difference]: Finished difference Result 467 states and 637 transitions. [2025-03-17 05:51:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:51:32,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-03-17 05:51:32,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:32,813 INFO L225 Difference]: With dead ends: 467 [2025-03-17 05:51:32,813 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 05:51:32,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:51:32,815 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:32,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:32,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 05:51:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-03-17 05:51:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 208 states have internal predecessors, (269), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 319 transitions. [2025-03-17 05:51:32,832 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 319 transitions. Word has length 181 [2025-03-17 05:51:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:32,833 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 319 transitions. [2025-03-17 05:51:32,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 319 transitions. [2025-03-17 05:51:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 05:51:32,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:32,834 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:32,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:51:32,834 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:32,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:32,835 INFO L85 PathProgramCache]: Analyzing trace with hash -2097480287, now seen corresponding path program 1 times [2025-03-17 05:51:32,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:32,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518607735] [2025-03-17 05:51:32,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:32,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:32,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 05:51:32,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 05:51:32,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:32,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:32,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:32,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518607735] [2025-03-17 05:51:32,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518607735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:32,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87302359] [2025-03-17 05:51:32,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:32,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:32,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:32,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:32,989 INFO L87 Difference]: Start difference. First operand 235 states and 319 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:33,043 INFO L93 Difference]: Finished difference Result 633 states and 855 transitions. [2025-03-17 05:51:33,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:33,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-03-17 05:51:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:33,046 INFO L225 Difference]: With dead ends: 633 [2025-03-17 05:51:33,046 INFO L226 Difference]: Without dead ends: 399 [2025-03-17 05:51:33,047 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:51:33,047 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 71 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:33,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 751 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:33,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-17 05:51:33,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 331. [2025-03-17 05:51:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 303 states have (on average 1.2937293729372936) internal successors, (392), 304 states have internal predecessors, (392), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 442 transitions. [2025-03-17 05:51:33,065 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 442 transitions. Word has length 181 [2025-03-17 05:51:33,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:33,066 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 442 transitions. [2025-03-17 05:51:33,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:33,066 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 442 transitions. [2025-03-17 05:51:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 05:51:33,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:33,067 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:33,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:51:33,067 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:33,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:33,067 INFO L85 PathProgramCache]: Analyzing trace with hash 261826722, now seen corresponding path program 1 times [2025-03-17 05:51:33,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:33,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080960476] [2025-03-17 05:51:33,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:33,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:33,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 05:51:33,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 05:51:33,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:33,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:33,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:33,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080960476] [2025-03-17 05:51:33,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080960476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:33,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:33,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:33,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428477948] [2025-03-17 05:51:33,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:33,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:33,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:33,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:33,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:33,218 INFO L87 Difference]: Start difference. First operand 331 states and 442 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:33,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:33,279 INFO L93 Difference]: Finished difference Result 719 states and 962 transitions. [2025-03-17 05:51:33,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:51:33,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-03-17 05:51:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:33,284 INFO L225 Difference]: With dead ends: 719 [2025-03-17 05:51:33,284 INFO L226 Difference]: Without dead ends: 389 [2025-03-17 05:51:33,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:33,287 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 71 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:33,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 905 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:33,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-17 05:51:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 319. [2025-03-17 05:51:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 291 states have (on average 1.2852233676975946) internal successors, (374), 292 states have internal predecessors, (374), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 424 transitions. [2025-03-17 05:51:33,308 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 424 transitions. Word has length 181 [2025-03-17 05:51:33,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:33,309 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 424 transitions. [2025-03-17 05:51:33,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 424 transitions. [2025-03-17 05:51:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 05:51:33,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:33,310 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:33,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:51:33,310 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:33,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:33,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1559853673, now seen corresponding path program 1 times [2025-03-17 05:51:33,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:33,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912785746] [2025-03-17 05:51:33,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:33,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:33,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 05:51:33,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 05:51:33,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:33,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:33,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:33,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912785746] [2025-03-17 05:51:33,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912785746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:33,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:33,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:51:33,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287920328] [2025-03-17 05:51:33,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:33,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:51:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:33,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:51:33,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:51:33,406 INFO L87 Difference]: Start difference. First operand 319 states and 424 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:33,438 INFO L93 Difference]: Finished difference Result 643 states and 855 transitions. [2025-03-17 05:51:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:51:33,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 183 [2025-03-17 05:51:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:33,442 INFO L225 Difference]: With dead ends: 643 [2025-03-17 05:51:33,442 INFO L226 Difference]: Without dead ends: 325 [2025-03-17 05:51:33,443 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:51:33,443 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 490 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:51:33,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 490 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:33,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-17 05:51:33,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2025-03-17 05:51:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 295 states have (on average 1.2813559322033898) internal successors, (378), 296 states have internal predecessors, (378), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 428 transitions. [2025-03-17 05:51:33,461 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 428 transitions. Word has length 183 [2025-03-17 05:51:33,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:33,462 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 428 transitions. [2025-03-17 05:51:33,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 428 transitions. [2025-03-17 05:51:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 05:51:33,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:33,463 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:33,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:51:33,463 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:33,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1430770954, now seen corresponding path program 1 times [2025-03-17 05:51:33,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:33,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817902133] [2025-03-17 05:51:33,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:33,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:33,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 05:51:33,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 05:51:33,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:33,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:33,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:33,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817902133] [2025-03-17 05:51:33,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817902133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:33,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:33,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:51:33,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891309428] [2025-03-17 05:51:33,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:33,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:51:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:33,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:51:33,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:51:33,988 INFO L87 Difference]: Start difference. First operand 323 states and 428 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:34,216 INFO L93 Difference]: Finished difference Result 797 states and 1053 transitions. [2025-03-17 05:51:34,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:51:34,217 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 183 [2025-03-17 05:51:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:34,220 INFO L225 Difference]: With dead ends: 797 [2025-03-17 05:51:34,220 INFO L226 Difference]: Without dead ends: 475 [2025-03-17 05:51:34,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:51:34,221 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 155 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:34,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 2244 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-17 05:51:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 374. [2025-03-17 05:51:34,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 346 states have (on average 1.2572254335260116) internal successors, (435), 347 states have internal predecessors, (435), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:51:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 485 transitions. [2025-03-17 05:51:34,240 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 485 transitions. Word has length 183 [2025-03-17 05:51:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:34,241 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 485 transitions. [2025-03-17 05:51:34,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 485 transitions. [2025-03-17 05:51:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 05:51:34,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:34,242 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:34,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:51:34,242 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:34,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:34,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1257156465, now seen corresponding path program 1 times [2025-03-17 05:51:34,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:34,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859815735] [2025-03-17 05:51:34,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:34,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:34,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 05:51:34,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 05:51:34,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:34,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:34,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:34,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859815735] [2025-03-17 05:51:34,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859815735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:34,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:34,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:34,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594820630] [2025-03-17 05:51:34,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:34,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:34,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:34,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:34,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:34,420 INFO L87 Difference]: Start difference. First operand 374 states and 485 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:34,494 INFO L93 Difference]: Finished difference Result 750 states and 970 transitions. [2025-03-17 05:51:34,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:34,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 184 [2025-03-17 05:51:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:34,504 INFO L225 Difference]: With dead ends: 750 [2025-03-17 05:51:34,504 INFO L226 Difference]: Without dead ends: 377 [2025-03-17 05:51:34,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:34,505 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 143 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:34,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 628 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-17 05:51:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 336. [2025-03-17 05:51:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 310 states have (on average 1.2419354838709677) internal successors, (385), 310 states have internal predecessors, (385), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:51:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 431 transitions. [2025-03-17 05:51:34,522 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 431 transitions. Word has length 184 [2025-03-17 05:51:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:34,523 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 431 transitions. [2025-03-17 05:51:34,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:34,523 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 431 transitions. [2025-03-17 05:51:34,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-17 05:51:34,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:34,528 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:34,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:51:34,528 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:34,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:34,528 INFO L85 PathProgramCache]: Analyzing trace with hash -672657511, now seen corresponding path program 1 times [2025-03-17 05:51:34,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:34,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248542877] [2025-03-17 05:51:34,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:34,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:34,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 05:51:34,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 05:51:34,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:34,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:34,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:34,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248542877] [2025-03-17 05:51:34,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248542877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:34,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:34,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:34,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439490436] [2025-03-17 05:51:34,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:34,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:34,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:34,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:34,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:34,741 INFO L87 Difference]: Start difference. First operand 336 states and 431 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:34,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:34,822 INFO L93 Difference]: Finished difference Result 705 states and 904 transitions. [2025-03-17 05:51:34,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:34,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 185 [2025-03-17 05:51:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:34,824 INFO L225 Difference]: With dead ends: 705 [2025-03-17 05:51:34,824 INFO L226 Difference]: Without dead ends: 370 [2025-03-17 05:51:34,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:34,825 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 123 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:34,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 540 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-17 05:51:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 336. [2025-03-17 05:51:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 310 states have (on average 1.238709677419355) internal successors, (384), 310 states have internal predecessors, (384), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:51:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 430 transitions. [2025-03-17 05:51:34,842 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 430 transitions. Word has length 185 [2025-03-17 05:51:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:34,842 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 430 transitions. [2025-03-17 05:51:34,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 430 transitions. [2025-03-17 05:51:34,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 05:51:34,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:34,844 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:34,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:51:34,845 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:34,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1150247252, now seen corresponding path program 1 times [2025-03-17 05:51:34,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:34,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602882134] [2025-03-17 05:51:34,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:34,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 05:51:34,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 05:51:34,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:34,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:35,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:35,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602882134] [2025-03-17 05:51:35,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602882134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:35,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:35,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:51:35,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338668223] [2025-03-17 05:51:35,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:35,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:51:35,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:35,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:51:35,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:51:35,511 INFO L87 Difference]: Start difference. First operand 336 states and 430 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:35,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:35,810 INFO L93 Difference]: Finished difference Result 788 states and 1009 transitions. [2025-03-17 05:51:35,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:51:35,810 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 186 [2025-03-17 05:51:35,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:35,813 INFO L225 Difference]: With dead ends: 788 [2025-03-17 05:51:35,813 INFO L226 Difference]: Without dead ends: 453 [2025-03-17 05:51:35,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:51:35,816 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 171 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:35,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1784 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:51:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-17 05:51:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 403. [2025-03-17 05:51:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 367 states have (on average 1.237057220708447) internal successors, (454), 368 states have internal predecessors, (454), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 05:51:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 516 transitions. [2025-03-17 05:51:35,840 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 516 transitions. Word has length 186 [2025-03-17 05:51:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:35,840 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 516 transitions. [2025-03-17 05:51:35,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 516 transitions. [2025-03-17 05:51:35,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 05:51:35,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:35,841 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:35,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:51:35,841 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:35,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1181698636, now seen corresponding path program 1 times [2025-03-17 05:51:35,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:35,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424197095] [2025-03-17 05:51:35,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:35,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:35,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 05:51:35,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 05:51:35,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:35,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:36,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:36,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424197095] [2025-03-17 05:51:36,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424197095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:36,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:36,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:51:36,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337205876] [2025-03-17 05:51:36,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:36,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:51:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:36,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:51:36,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:51:36,433 INFO L87 Difference]: Start difference. First operand 403 states and 516 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:36,714 INFO L93 Difference]: Finished difference Result 877 states and 1121 transitions. [2025-03-17 05:51:36,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:51:36,715 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 186 [2025-03-17 05:51:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:36,717 INFO L225 Difference]: With dead ends: 877 [2025-03-17 05:51:36,718 INFO L226 Difference]: Without dead ends: 475 [2025-03-17 05:51:36,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:51:36,719 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 264 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:36,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1101 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:51:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-17 05:51:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 372. [2025-03-17 05:51:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 345 states have (on average 1.2318840579710144) internal successors, (425), 345 states have internal predecessors, (425), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:51:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 471 transitions. [2025-03-17 05:51:36,740 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 471 transitions. Word has length 186 [2025-03-17 05:51:36,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:36,741 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 471 transitions. [2025-03-17 05:51:36,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:36,741 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 471 transitions. [2025-03-17 05:51:36,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 05:51:36,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:36,742 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:36,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:51:36,742 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:36,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:36,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1052615917, now seen corresponding path program 1 times [2025-03-17 05:51:36,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:36,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159929308] [2025-03-17 05:51:36,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:36,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:36,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 05:51:36,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 05:51:36,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:36,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:37,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:37,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159929308] [2025-03-17 05:51:37,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159929308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:37,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:37,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:51:37,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960545188] [2025-03-17 05:51:37,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:37,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:51:37,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:37,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:51:37,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:37,103 INFO L87 Difference]: Start difference. First operand 372 states and 471 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:37,243 INFO L93 Difference]: Finished difference Result 801 states and 1015 transitions. [2025-03-17 05:51:37,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:51:37,244 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 186 [2025-03-17 05:51:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:37,246 INFO L225 Difference]: With dead ends: 801 [2025-03-17 05:51:37,246 INFO L226 Difference]: Without dead ends: 430 [2025-03-17 05:51:37,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:51:37,247 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 301 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:37,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1283 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-17 05:51:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 424. [2025-03-17 05:51:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 389 states have (on average 1.231362467866324) internal successors, (479), 390 states have internal predecessors, (479), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 05:51:37,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 537 transitions. [2025-03-17 05:51:37,275 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 537 transitions. Word has length 186 [2025-03-17 05:51:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:37,276 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 537 transitions. [2025-03-17 05:51:37,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 537 transitions. [2025-03-17 05:51:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 05:51:37,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:37,278 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:37,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 05:51:37,278 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:37,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:37,279 INFO L85 PathProgramCache]: Analyzing trace with hash 454935892, now seen corresponding path program 1 times [2025-03-17 05:51:37,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:37,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954337183] [2025-03-17 05:51:37,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:37,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:37,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 05:51:37,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 05:51:37,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:37,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:37,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:37,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954337183] [2025-03-17 05:51:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954337183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:37,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:37,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:37,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633004324] [2025-03-17 05:51:37,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:37,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:37,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:37,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:37,505 INFO L87 Difference]: Start difference. First operand 424 states and 537 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:37,601 INFO L93 Difference]: Finished difference Result 1126 states and 1420 transitions. [2025-03-17 05:51:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:37,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 186 [2025-03-17 05:51:37,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:37,605 INFO L225 Difference]: With dead ends: 1126 [2025-03-17 05:51:37,605 INFO L226 Difference]: Without dead ends: 703 [2025-03-17 05:51:37,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:37,607 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 145 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:37,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 577 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-03-17 05:51:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 685. [2025-03-17 05:51:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 638 states have (on average 1.2351097178683386) internal successors, (788), 641 states have internal predecessors, (788), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 05:51:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 862 transitions. [2025-03-17 05:51:37,646 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 862 transitions. Word has length 186 [2025-03-17 05:51:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:37,646 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 862 transitions. [2025-03-17 05:51:37,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 862 transitions. [2025-03-17 05:51:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 05:51:37,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:37,648 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:37,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 05:51:37,648 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:37,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash 227563669, now seen corresponding path program 1 times [2025-03-17 05:51:37,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:37,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383394881] [2025-03-17 05:51:37,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:37,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:37,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 05:51:37,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 05:51:37,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:37,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:37,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:37,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383394881] [2025-03-17 05:51:37,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383394881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:37,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:37,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:51:37,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960786670] [2025-03-17 05:51:37,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:37,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:51:37,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:37,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:51:37,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:37,948 INFO L87 Difference]: Start difference. First operand 685 states and 862 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:38,116 INFO L93 Difference]: Finished difference Result 1382 states and 1736 transitions. [2025-03-17 05:51:38,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:51:38,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 186 [2025-03-17 05:51:38,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:38,120 INFO L225 Difference]: With dead ends: 1382 [2025-03-17 05:51:38,120 INFO L226 Difference]: Without dead ends: 698 [2025-03-17 05:51:38,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:51:38,123 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 269 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:38,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1469 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-17 05:51:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 688. [2025-03-17 05:51:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 638 states have (on average 1.2272727272727273) internal successors, (783), 641 states have internal predecessors, (783), 39 states have call successors, (39), 10 states have call predecessors, (39), 10 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:51:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 861 transitions. [2025-03-17 05:51:38,164 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 861 transitions. Word has length 186 [2025-03-17 05:51:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:38,164 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 861 transitions. [2025-03-17 05:51:38,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 861 transitions. [2025-03-17 05:51:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 05:51:38,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:38,166 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:38,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 05:51:38,166 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:38,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash 579009139, now seen corresponding path program 1 times [2025-03-17 05:51:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:38,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824411505] [2025-03-17 05:51:38,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:38,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:38,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 05:51:38,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 05:51:38,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:38,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:38,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:38,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824411505] [2025-03-17 05:51:38,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824411505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:38,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:38,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:38,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690117915] [2025-03-17 05:51:38,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:38,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:38,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:38,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:38,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:38,264 INFO L87 Difference]: Start difference. First operand 688 states and 861 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:38,311 INFO L93 Difference]: Finished difference Result 1221 states and 1530 transitions. [2025-03-17 05:51:38,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:38,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 186 [2025-03-17 05:51:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:38,314 INFO L225 Difference]: With dead ends: 1221 [2025-03-17 05:51:38,314 INFO L226 Difference]: Without dead ends: 534 [2025-03-17 05:51:38,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:38,316 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:38,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 653 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-17 05:51:38,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 487. [2025-03-17 05:51:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 451 states have (on average 1.221729490022173) internal successors, (551), 452 states have internal predecessors, (551), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 05:51:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 609 transitions. [2025-03-17 05:51:38,343 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 609 transitions. Word has length 186 [2025-03-17 05:51:38,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:38,343 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 609 transitions. [2025-03-17 05:51:38,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 609 transitions. [2025-03-17 05:51:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 05:51:38,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:38,345 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:38,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 05:51:38,345 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:38,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:38,345 INFO L85 PathProgramCache]: Analyzing trace with hash 351636916, now seen corresponding path program 1 times [2025-03-17 05:51:38,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:38,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274165000] [2025-03-17 05:51:38,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:38,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:38,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 05:51:38,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 05:51:38,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:38,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:38,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:38,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274165000] [2025-03-17 05:51:38,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274165000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:38,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:38,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:38,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037351857] [2025-03-17 05:51:38,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:38,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:38,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:38,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:38,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:38,523 INFO L87 Difference]: Start difference. First operand 487 states and 609 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:38,603 INFO L93 Difference]: Finished difference Result 1011 states and 1263 transitions. [2025-03-17 05:51:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:38,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 186 [2025-03-17 05:51:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:38,606 INFO L225 Difference]: With dead ends: 1011 [2025-03-17 05:51:38,606 INFO L226 Difference]: Without dead ends: 525 [2025-03-17 05:51:38,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:38,608 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 135 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:38,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 657 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-17 05:51:38,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 522. [2025-03-17 05:51:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 480 states have (on average 1.2208333333333334) internal successors, (586), 482 states have internal predecessors, (586), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 05:51:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 652 transitions. [2025-03-17 05:51:38,636 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 652 transitions. Word has length 186 [2025-03-17 05:51:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:38,636 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 652 transitions. [2025-03-17 05:51:38,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 652 transitions. [2025-03-17 05:51:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 05:51:38,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:38,638 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:38,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 05:51:38,638 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:38,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:38,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1313202207, now seen corresponding path program 1 times [2025-03-17 05:51:38,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:38,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881553502] [2025-03-17 05:51:38,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:38,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:38,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 05:51:38,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 05:51:38,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:38,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:39,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:39,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881553502] [2025-03-17 05:51:39,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881553502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:39,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:39,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:51:39,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059069639] [2025-03-17 05:51:39,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:39,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:51:39,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:39,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:51:39,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:39,006 INFO L87 Difference]: Start difference. First operand 522 states and 652 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-17 05:51:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:39,473 INFO L93 Difference]: Finished difference Result 1402 states and 1766 transitions. [2025-03-17 05:51:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:51:39,473 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 187 [2025-03-17 05:51:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:39,476 INFO L225 Difference]: With dead ends: 1402 [2025-03-17 05:51:39,476 INFO L226 Difference]: Without dead ends: 881 [2025-03-17 05:51:39,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:51:39,478 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 651 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:39,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1335 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:51:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-17 05:51:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 713. [2025-03-17 05:51:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 651 states have (on average 1.1981566820276497) internal successors, (780), 655 states have internal predecessors, (780), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-17 05:51:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 874 transitions. [2025-03-17 05:51:39,524 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 874 transitions. Word has length 187 [2025-03-17 05:51:39,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:39,525 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 874 transitions. [2025-03-17 05:51:39,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-17 05:51:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 874 transitions. [2025-03-17 05:51:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 05:51:39,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:39,526 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:39,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 05:51:39,526 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:39,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1931742547, now seen corresponding path program 1 times [2025-03-17 05:51:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:39,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440280678] [2025-03-17 05:51:39,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:39,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 05:51:39,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 05:51:39,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:39,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:39,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:39,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440280678] [2025-03-17 05:51:39,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440280678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:39,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:39,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:39,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609408996] [2025-03-17 05:51:39,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:39,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:39,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:39,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:39,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:39,715 INFO L87 Difference]: Start difference. First operand 713 states and 874 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:39,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:39,820 INFO L93 Difference]: Finished difference Result 2043 states and 2490 transitions. [2025-03-17 05:51:39,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:51:39,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2025-03-17 05:51:39,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:39,824 INFO L225 Difference]: With dead ends: 2043 [2025-03-17 05:51:39,824 INFO L226 Difference]: Without dead ends: 1331 [2025-03-17 05:51:39,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:39,826 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 87 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:39,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 646 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-03-17 05:51:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1323. [2025-03-17 05:51:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 1213 states have (on average 1.1896125309150865) internal successors, (1443), 1222 states have internal predecessors, (1443), 81 states have call successors, (81), 28 states have call predecessors, (81), 28 states have return successors, (81), 72 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 05:51:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1605 transitions. [2025-03-17 05:51:39,907 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1605 transitions. Word has length 187 [2025-03-17 05:51:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:39,908 INFO L471 AbstractCegarLoop]: Abstraction has 1323 states and 1605 transitions. [2025-03-17 05:51:39,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:39,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1605 transitions. [2025-03-17 05:51:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 05:51:39,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:39,911 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:39,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 05:51:39,911 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:39,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2060825266, now seen corresponding path program 1 times [2025-03-17 05:51:39,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:39,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991435989] [2025-03-17 05:51:39,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:39,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:39,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 05:51:39,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 05:51:39,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:39,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:39,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:39,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991435989] [2025-03-17 05:51:39,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991435989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:39,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:39,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:51:39,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846720907] [2025-03-17 05:51:39,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:39,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:51:39,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:39,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:51:39,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:51:39,982 INFO L87 Difference]: Start difference. First operand 1323 states and 1605 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:40,117 INFO L93 Difference]: Finished difference Result 2660 states and 3229 transitions. [2025-03-17 05:51:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:51:40,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2025-03-17 05:51:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:40,123 INFO L225 Difference]: With dead ends: 2660 [2025-03-17 05:51:40,123 INFO L226 Difference]: Without dead ends: 1338 [2025-03-17 05:51:40,125 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:51:40,126 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:40,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 491 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:40,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-17 05:51:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1333. [2025-03-17 05:51:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1223 states have (on average 1.1839738348323794) internal successors, (1448), 1232 states have internal predecessors, (1448), 81 states have call successors, (81), 28 states have call predecessors, (81), 28 states have return successors, (81), 72 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 05:51:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1610 transitions. [2025-03-17 05:51:40,253 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1610 transitions. Word has length 187 [2025-03-17 05:51:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:40,253 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1610 transitions. [2025-03-17 05:51:40,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1610 transitions. [2025-03-17 05:51:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 05:51:40,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:40,256 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:40,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 05:51:40,257 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:40,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:40,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1864311761, now seen corresponding path program 1 times [2025-03-17 05:51:40,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:40,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205280216] [2025-03-17 05:51:40,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:40,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:40,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 05:51:40,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 05:51:40,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:40,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:40,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:40,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205280216] [2025-03-17 05:51:40,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205280216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:40,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:40,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:51:40,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924228934] [2025-03-17 05:51:40,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:40,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:51:40,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:40,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:51:40,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:51:40,623 INFO L87 Difference]: Start difference. First operand 1333 states and 1610 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:40,884 INFO L93 Difference]: Finished difference Result 3436 states and 4146 transitions. [2025-03-17 05:51:40,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:51:40,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2025-03-17 05:51:40,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:40,890 INFO L225 Difference]: With dead ends: 3436 [2025-03-17 05:51:40,891 INFO L226 Difference]: Without dead ends: 2104 [2025-03-17 05:51:40,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:51:40,892 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 2136 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:40,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 2136 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:40,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2025-03-17 05:51:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 1761. [2025-03-17 05:51:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1639 states have (on average 1.1586333129957291) internal successors, (1899), 1649 states have internal predecessors, (1899), 89 states have call successors, (89), 32 states have call predecessors, (89), 32 states have return successors, (89), 79 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-17 05:51:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2077 transitions. [2025-03-17 05:51:40,993 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2077 transitions. Word has length 187 [2025-03-17 05:51:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:40,994 INFO L471 AbstractCegarLoop]: Abstraction has 1761 states and 2077 transitions. [2025-03-17 05:51:40,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2077 transitions. [2025-03-17 05:51:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 05:51:40,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:40,997 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:40,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 05:51:40,997 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:40,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:40,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1162641451, now seen corresponding path program 1 times [2025-03-17 05:51:40,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:40,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16360701] [2025-03-17 05:51:40,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:40,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:41,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 05:51:41,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 05:51:41,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:41,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:41,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:41,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16360701] [2025-03-17 05:51:41,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16360701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:41,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:41,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:51:41,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166749663] [2025-03-17 05:51:41,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:41,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:51:41,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:41,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:51:41,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:41,477 INFO L87 Difference]: Start difference. First operand 1761 states and 2077 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:41,858 INFO L93 Difference]: Finished difference Result 4103 states and 4851 transitions. [2025-03-17 05:51:41,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:51:41,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2025-03-17 05:51:41,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:41,865 INFO L225 Difference]: With dead ends: 4103 [2025-03-17 05:51:41,866 INFO L226 Difference]: Without dead ends: 2375 [2025-03-17 05:51:41,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:51:41,868 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 166 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:41,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1535 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:51:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2025-03-17 05:51:42,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2359. [2025-03-17 05:51:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2185 states have (on average 1.1583524027459955) internal successors, (2531), 2200 states have internal predecessors, (2531), 127 states have call successors, (127), 46 states have call predecessors, (127), 46 states have return successors, (127), 112 states have call predecessors, (127), 127 states have call successors, (127) [2025-03-17 05:51:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 2785 transitions. [2025-03-17 05:51:42,032 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 2785 transitions. Word has length 187 [2025-03-17 05:51:42,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:42,032 INFO L471 AbstractCegarLoop]: Abstraction has 2359 states and 2785 transitions. [2025-03-17 05:51:42,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 2785 transitions. [2025-03-17 05:51:42,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 05:51:42,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:42,038 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:42,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 05:51:42,039 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:42,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:42,039 INFO L85 PathProgramCache]: Analyzing trace with hash 470162548, now seen corresponding path program 1 times [2025-03-17 05:51:42,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:42,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387435991] [2025-03-17 05:51:42,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:42,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:42,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 05:51:42,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 05:51:42,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:42,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:42,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:42,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387435991] [2025-03-17 05:51:42,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387435991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:42,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:42,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:51:42,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386005339] [2025-03-17 05:51:42,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:42,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:51:42,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:42,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:51:42,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:51:42,256 INFO L87 Difference]: Start difference. First operand 2359 states and 2785 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:42,487 INFO L93 Difference]: Finished difference Result 4906 states and 5807 transitions. [2025-03-17 05:51:42,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:51:42,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2025-03-17 05:51:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:42,495 INFO L225 Difference]: With dead ends: 4906 [2025-03-17 05:51:42,496 INFO L226 Difference]: Without dead ends: 2580 [2025-03-17 05:51:42,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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:51:42,499 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 151 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:42,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 995 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2025-03-17 05:51:42,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2557. [2025-03-17 05:51:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2330 states have (on average 1.159656652360515) internal successors, (2702), 2350 states have internal predecessors, (2702), 165 states have call successors, (165), 61 states have call predecessors, (165), 61 states have return successors, (165), 145 states have call predecessors, (165), 165 states have call successors, (165) [2025-03-17 05:51:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3032 transitions. [2025-03-17 05:51:42,782 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3032 transitions. Word has length 187 [2025-03-17 05:51:42,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:42,783 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 3032 transitions. [2025-03-17 05:51:42,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3032 transitions. [2025-03-17 05:51:42,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 05:51:42,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:42,787 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:42,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 05:51:42,787 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:42,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:42,787 INFO L85 PathProgramCache]: Analyzing trace with hash -303265927, now seen corresponding path program 1 times [2025-03-17 05:51:42,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:42,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880432015] [2025-03-17 05:51:42,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:42,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:42,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 05:51:42,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 05:51:42,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:42,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:43,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:43,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880432015] [2025-03-17 05:51:43,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880432015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:43,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:43,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:51:43,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003864175] [2025-03-17 05:51:43,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:43,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:51:43,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:43,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:51:43,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:51:43,545 INFO L87 Difference]: Start difference. First operand 2557 states and 3032 transitions. Second operand has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 14 states have internal predecessors, (76), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-17 05:51:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:44,759 INFO L93 Difference]: Finished difference Result 7317 states and 8666 transitions. [2025-03-17 05:51:44,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:51:44,759 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 14 states have internal predecessors, (76), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 188 [2025-03-17 05:51:44,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:44,781 INFO L225 Difference]: With dead ends: 7317 [2025-03-17 05:51:44,781 INFO L226 Difference]: Without dead ends: 4801 [2025-03-17 05:51:44,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:51:44,787 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 533 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:44,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 2256 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:51:44,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4801 states. [2025-03-17 05:51:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4801 to 2653. [2025-03-17 05:51:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2426 states have (on average 1.159934047815334) internal successors, (2814), 2446 states have internal predecessors, (2814), 165 states have call successors, (165), 61 states have call predecessors, (165), 61 states have return successors, (165), 145 states have call predecessors, (165), 165 states have call successors, (165) [2025-03-17 05:51:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3144 transitions. [2025-03-17 05:51:44,985 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3144 transitions. Word has length 188 [2025-03-17 05:51:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:44,985 INFO L471 AbstractCegarLoop]: Abstraction has 2653 states and 3144 transitions. [2025-03-17 05:51:44,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 14 states have internal predecessors, (76), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-17 05:51:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3144 transitions. [2025-03-17 05:51:44,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 05:51:44,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:44,989 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:44,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 05:51:44,989 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:44,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:44,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1981597528, now seen corresponding path program 1 times [2025-03-17 05:51:44,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:44,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152597214] [2025-03-17 05:51:44,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:44,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:45,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 05:51:45,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 05:51:45,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:45,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:45,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:45,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152597214] [2025-03-17 05:51:45,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152597214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:45,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:45,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:45,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844060596] [2025-03-17 05:51:45,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:45,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:45,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:45,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:45,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:45,157 INFO L87 Difference]: Start difference. First operand 2653 states and 3144 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:45,385 INFO L93 Difference]: Finished difference Result 5093 states and 6042 transitions. [2025-03-17 05:51:45,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:45,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 188 [2025-03-17 05:51:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:45,396 INFO L225 Difference]: With dead ends: 5093 [2025-03-17 05:51:45,397 INFO L226 Difference]: Without dead ends: 2481 [2025-03-17 05:51:45,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:45,400 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 90 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:45,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 769 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:45,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2025-03-17 05:51:45,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2479. [2025-03-17 05:51:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 2252 states have (on average 1.153197158081705) internal successors, (2597), 2272 states have internal predecessors, (2597), 165 states have call successors, (165), 61 states have call predecessors, (165), 61 states have return successors, (165), 145 states have call predecessors, (165), 165 states have call successors, (165) [2025-03-17 05:51:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 2927 transitions. [2025-03-17 05:51:45,580 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 2927 transitions. Word has length 188 [2025-03-17 05:51:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:45,580 INFO L471 AbstractCegarLoop]: Abstraction has 2479 states and 2927 transitions. [2025-03-17 05:51:45,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 2927 transitions. [2025-03-17 05:51:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-17 05:51:45,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:45,584 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:45,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-17 05:51:45,584 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:45,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:45,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2024635019, now seen corresponding path program 1 times [2025-03-17 05:51:45,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:45,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113752387] [2025-03-17 05:51:45,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:45,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 05:51:45,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 05:51:45,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:45,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:51:45,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:45,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113752387] [2025-03-17 05:51:45,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113752387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:45,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160235425] [2025-03-17 05:51:45,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:45,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:45,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:45,848 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:45,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:51:46,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 05:51:46,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 05:51:46,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:46,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:46,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:51:46,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:46,206 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:51:46,453 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 23 [2025-03-17 05:51:46,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 19 proven. 297 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2025-03-17 05:51:46,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:51:46,710 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 27 treesize of output 23 [2025-03-17 05:51:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:51:46,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160235425] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:51:46,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:51:46,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2025-03-17 05:51:46,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867428508] [2025-03-17 05:51:46,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:51:46,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:51:46,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:46,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:51:46,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:51:46,737 INFO L87 Difference]: Start difference. First operand 2479 states and 2927 transitions. Second operand has 13 states, 11 states have (on average 8.454545454545455) internal successors, (93), 13 states have internal predecessors, (93), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) [2025-03-17 05:51:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:47,160 INFO L93 Difference]: Finished difference Result 4627 states and 5432 transitions. [2025-03-17 05:51:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:51:47,161 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.454545454545455) internal successors, (93), 13 states have internal predecessors, (93), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) Word has length 189 [2025-03-17 05:51:47,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:47,168 INFO L225 Difference]: With dead ends: 4627 [2025-03-17 05:51:47,169 INFO L226 Difference]: Without dead ends: 2189 [2025-03-17 05:51:47,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:51:47,172 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 510 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:47,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 597 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:51:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2025-03-17 05:51:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 1351. [2025-03-17 05:51:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1224 states have (on average 1.1544117647058822) internal successors, (1413), 1232 states have internal predecessors, (1413), 93 states have call successors, (93), 33 states have call predecessors, (93), 33 states have return successors, (93), 85 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 05:51:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1599 transitions. [2025-03-17 05:51:47,280 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1599 transitions. Word has length 189 [2025-03-17 05:51:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:47,280 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 1599 transitions. [2025-03-17 05:51:47,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.454545454545455) internal successors, (93), 13 states have internal predecessors, (93), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) [2025-03-17 05:51:47,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1599 transitions. [2025-03-17 05:51:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 05:51:47,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:47,283 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:47,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:51:47,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:47,484 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:47,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:47,485 INFO L85 PathProgramCache]: Analyzing trace with hash 307098217, now seen corresponding path program 1 times [2025-03-17 05:51:47,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:47,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013818640] [2025-03-17 05:51:47,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:47,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:47,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 05:51:47,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 05:51:47,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:47,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:51:47,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:47,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013818640] [2025-03-17 05:51:47,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013818640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:47,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861152342] [2025-03-17 05:51:47,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:47,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:47,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:47,856 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:47,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 05:51:48,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 05:51:48,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 05:51:48,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:48,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:48,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 05:51:48,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:48,281 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:51:48,462 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 11 treesize of output 7 [2025-03-17 05:51:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 13 proven. 543 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2025-03-17 05:51:48,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:51:48,846 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 27 treesize of output 23 [2025-03-17 05:51:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:51:48,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861152342] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:51:48,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:51:48,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 23 [2025-03-17 05:51:48,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110689934] [2025-03-17 05:51:48,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:51:48,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 05:51:48,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:48,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 05:51:48,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:51:48,912 INFO L87 Difference]: Start difference. First operand 1351 states and 1599 transitions. Second operand has 23 states, 19 states have (on average 7.894736842105263) internal successors, (150), 22 states have internal predecessors, (150), 9 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 6 states have call predecessors, (69), 9 states have call successors, (69) [2025-03-17 05:51:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:50,900 INFO L93 Difference]: Finished difference Result 2726 states and 3221 transitions. [2025-03-17 05:51:50,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-17 05:51:50,901 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 7.894736842105263) internal successors, (150), 22 states have internal predecessors, (150), 9 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 6 states have call predecessors, (69), 9 states have call successors, (69) Word has length 192 [2025-03-17 05:51:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:50,910 INFO L225 Difference]: With dead ends: 2726 [2025-03-17 05:51:50,910 INFO L226 Difference]: Without dead ends: 1416 [2025-03-17 05:51:50,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 377 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=972, Invalid=4430, Unknown=0, NotChecked=0, Total=5402 [2025-03-17 05:51:50,915 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1045 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:50,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1403 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:51:50,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2025-03-17 05:51:51,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1173. [2025-03-17 05:51:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1042 states have (on average 1.1573896353166986) internal successors, (1206), 1050 states have internal predecessors, (1206), 91 states have call successors, (91), 39 states have call predecessors, (91), 39 states have return successors, (91), 83 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-17 05:51:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1388 transitions. [2025-03-17 05:51:51,036 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1388 transitions. Word has length 192 [2025-03-17 05:51:51,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:51,037 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1388 transitions. [2025-03-17 05:51:51,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 7.894736842105263) internal successors, (150), 22 states have internal predecessors, (150), 9 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 6 states have call predecessors, (69), 9 states have call successors, (69) [2025-03-17 05:51:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1388 transitions. [2025-03-17 05:51:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 05:51:51,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:51,038 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:51,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 05:51:51,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:51,239 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:51,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:51,240 INFO L85 PathProgramCache]: Analyzing trace with hash -364400147, now seen corresponding path program 1 times [2025-03-17 05:51:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:51,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360137616] [2025-03-17 05:51:51,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:51,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:51,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 05:51:51,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 05:51:51,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:51,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:51,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:51,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360137616] [2025-03-17 05:51:51,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360137616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:51,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:51,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:51:51,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503845027] [2025-03-17 05:51:51,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:51,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:51:51,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:51,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:51:51,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:51,899 INFO L87 Difference]: Start difference. First operand 1173 states and 1388 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:52,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:52,184 INFO L93 Difference]: Finished difference Result 2365 states and 2798 transitions. [2025-03-17 05:51:52,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:51:52,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 192 [2025-03-17 05:51:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:52,191 INFO L225 Difference]: With dead ends: 2365 [2025-03-17 05:51:52,191 INFO L226 Difference]: Without dead ends: 1193 [2025-03-17 05:51:52,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:51:52,192 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 99 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:52,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1733 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-03-17 05:51:52,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1031. [2025-03-17 05:51:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 938 states have (on average 1.1556503198294243) internal successors, (1084), 943 states have internal predecessors, (1084), 65 states have call successors, (65), 27 states have call predecessors, (65), 27 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:51:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1214 transitions. [2025-03-17 05:51:52,276 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1214 transitions. Word has length 192 [2025-03-17 05:51:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:52,276 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1214 transitions. [2025-03-17 05:51:52,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:52,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1214 transitions. [2025-03-17 05:51:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 05:51:52,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:52,278 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:52,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-17 05:51:52,278 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:52,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:52,278 INFO L85 PathProgramCache]: Analyzing trace with hash -560913652, now seen corresponding path program 1 times [2025-03-17 05:51:52,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:52,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639820895] [2025-03-17 05:51:52,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:52,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:52,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 05:51:52,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 05:51:52,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:52,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:52,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:52,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639820895] [2025-03-17 05:51:52,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639820895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:52,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:52,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:51:52,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222623291] [2025-03-17 05:51:52,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:52,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:51:52,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:52,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:51:52,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:51:52,538 INFO L87 Difference]: Start difference. First operand 1031 states and 1214 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:52,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:52,701 INFO L93 Difference]: Finished difference Result 2067 states and 2431 transitions. [2025-03-17 05:51:52,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:51:52,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 192 [2025-03-17 05:51:52,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:52,706 INFO L225 Difference]: With dead ends: 2067 [2025-03-17 05:51:52,706 INFO L226 Difference]: Without dead ends: 1037 [2025-03-17 05:51:52,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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:51:52,707 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 89 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:52,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1035 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2025-03-17 05:51:52,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1029. [2025-03-17 05:51:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 935 states have (on average 1.1497326203208555) internal successors, (1075), 940 states have internal predecessors, (1075), 65 states have call successors, (65), 28 states have call predecessors, (65), 28 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:51:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1205 transitions. [2025-03-17 05:51:52,866 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1205 transitions. Word has length 192 [2025-03-17 05:51:52,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:52,866 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1205 transitions. [2025-03-17 05:51:52,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1205 transitions. [2025-03-17 05:51:52,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 05:51:52,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:52,869 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:52,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-17 05:51:52,869 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:52,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash -431830933, now seen corresponding path program 1 times [2025-03-17 05:51:52,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:52,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781359447] [2025-03-17 05:51:52,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:52,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:52,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 05:51:52,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 05:51:52,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:52,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:53,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:53,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781359447] [2025-03-17 05:51:53,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781359447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:53,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:53,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:53,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881100884] [2025-03-17 05:51:53,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:53,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:53,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:53,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:53,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:53,083 INFO L87 Difference]: Start difference. First operand 1029 states and 1205 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:53,246 INFO L93 Difference]: Finished difference Result 2077 states and 2431 transitions. [2025-03-17 05:51:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:53,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 192 [2025-03-17 05:51:53,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:53,250 INFO L225 Difference]: With dead ends: 2077 [2025-03-17 05:51:53,250 INFO L226 Difference]: Without dead ends: 1049 [2025-03-17 05:51:53,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:53,251 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 142 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:53,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 465 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-03-17 05:51:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 819. [2025-03-17 05:51:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 725 states have (on average 1.1448275862068966) internal successors, (830), 730 states have internal predecessors, (830), 65 states have call successors, (65), 28 states have call predecessors, (65), 28 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:51:53,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 960 transitions. [2025-03-17 05:51:53,339 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 960 transitions. Word has length 192 [2025-03-17 05:51:53,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:53,339 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 960 transitions. [2025-03-17 05:51:53,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 960 transitions. [2025-03-17 05:51:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 05:51:53,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:53,340 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:53,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-17 05:51:53,340 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:53,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash 149255689, now seen corresponding path program 1 times [2025-03-17 05:51:53,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:53,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412327637] [2025-03-17 05:51:53,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:53,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:53,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 05:51:53,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 05:51:53,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:53,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:51:53,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:53,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412327637] [2025-03-17 05:51:53,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412327637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:53,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484055533] [2025-03-17 05:51:53,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:53,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:53,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:53,720 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:53,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 05:51:53,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 05:51:53,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 05:51:53,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:53,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:53,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 05:51:53,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:54,163 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:51:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 8 proven. 528 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2025-03-17 05:51:54,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:51:54,468 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 36 treesize of output 32 [2025-03-17 05:51:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:51:54,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484055533] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:51:54,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:51:54,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2025-03-17 05:51:54,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014915404] [2025-03-17 05:51:54,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:51:54,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:51:54,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:54,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:51:54,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:51:54,580 INFO L87 Difference]: Start difference. First operand 819 states and 960 transitions. Second operand has 17 states, 14 states have (on average 7.142857142857143) internal successors, (100), 16 states have internal predecessors, (100), 5 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 3 states have call predecessors, (47), 5 states have call successors, (47) [2025-03-17 05:51:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:55,118 INFO L93 Difference]: Finished difference Result 1754 states and 2042 transitions. [2025-03-17 05:51:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:51:55,119 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 7.142857142857143) internal successors, (100), 16 states have internal predecessors, (100), 5 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 3 states have call predecessors, (47), 5 states have call successors, (47) Word has length 192 [2025-03-17 05:51:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:55,121 INFO L225 Difference]: With dead ends: 1754 [2025-03-17 05:51:55,122 INFO L226 Difference]: Without dead ends: 936 [2025-03-17 05:51:55,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 376 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:51:55,123 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 403 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:55,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1147 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:51:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-03-17 05:51:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 879. [2025-03-17 05:51:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 763 states have (on average 1.129750982961992) internal successors, (862), 769 states have internal predecessors, (862), 79 states have call successors, (79), 36 states have call predecessors, (79), 36 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-17 05:51:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1020 transitions. [2025-03-17 05:51:55,298 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1020 transitions. Word has length 192 [2025-03-17 05:51:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:55,298 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1020 transitions. [2025-03-17 05:51:55,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 7.142857142857143) internal successors, (100), 16 states have internal predecessors, (100), 5 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 3 states have call predecessors, (47), 5 states have call successors, (47) [2025-03-17 05:51:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1020 transitions. [2025-03-17 05:51:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 05:51:55,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:55,300 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:55,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 05:51:55,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:55,504 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:55,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:55,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1657321879, now seen corresponding path program 1 times [2025-03-17 05:51:55,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:55,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801189847] [2025-03-17 05:51:55,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:55,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:55,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 05:51:55,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 05:51:55,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:55,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:51:55,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:55,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801189847] [2025-03-17 05:51:55,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801189847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:55,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178690095] [2025-03-17 05:51:55,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:55,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:55,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:55,812 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:55,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 05:51:56,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 05:51:56,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 05:51:56,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:56,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:56,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:51:56,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:56,235 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:51:56,386 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 37 treesize of output 25 [2025-03-17 05:51:56,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 10 proven. 558 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-17 05:51:56,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:51:56,583 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 36 treesize of output 32 [2025-03-17 05:51:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:51:56,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178690095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:51:56,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:51:56,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2025-03-17 05:51:56,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101751038] [2025-03-17 05:51:56,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:51:56,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:51:56,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:56,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:51:56,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:51:56,659 INFO L87 Difference]: Start difference. First operand 879 states and 1020 transitions. Second operand has 16 states, 13 states have (on average 9.76923076923077) internal successors, (127), 15 states have internal predecessors, (127), 5 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 3 states have call predecessors, (47), 5 states have call successors, (47) [2025-03-17 05:51:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:57,193 INFO L93 Difference]: Finished difference Result 1377 states and 1594 transitions. [2025-03-17 05:51:57,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:51:57,194 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 9.76923076923077) internal successors, (127), 15 states have internal predecessors, (127), 5 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 3 states have call predecessors, (47), 5 states have call successors, (47) Word has length 192 [2025-03-17 05:51:57,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:57,196 INFO L225 Difference]: With dead ends: 1377 [2025-03-17 05:51:57,196 INFO L226 Difference]: Without dead ends: 555 [2025-03-17 05:51:57,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 377 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2025-03-17 05:51:57,197 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 403 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:57,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1127 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:51:57,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-17 05:51:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 521. [2025-03-17 05:51:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 444 states have (on average 1.117117117117117) internal successors, (496), 447 states have internal predecessors, (496), 51 states have call successors, (51), 25 states have call predecessors, (51), 25 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 05:51:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 598 transitions. [2025-03-17 05:51:57,273 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 598 transitions. Word has length 192 [2025-03-17 05:51:57,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:57,273 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 598 transitions. [2025-03-17 05:51:57,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 9.76923076923077) internal successors, (127), 15 states have internal predecessors, (127), 5 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 3 states have call predecessors, (47), 5 states have call successors, (47) [2025-03-17 05:51:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 598 transitions. [2025-03-17 05:51:57,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 05:51:57,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:57,274 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:57,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 05:51:57,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-17 05:51:57,475 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:57,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:57,475 INFO L85 PathProgramCache]: Analyzing trace with hash -873795161, now seen corresponding path program 1 times [2025-03-17 05:51:57,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:57,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863891563] [2025-03-17 05:51:57,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:57,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:57,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 05:51:57,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 05:51:57,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:57,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:57,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:57,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863891563] [2025-03-17 05:51:57,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863891563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:57,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:57,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:57,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801306335] [2025-03-17 05:51:57,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:57,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:57,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:57,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:57,734 INFO L87 Difference]: Start difference. First operand 521 states and 598 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:57,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:57,887 INFO L93 Difference]: Finished difference Result 981 states and 1129 transitions. [2025-03-17 05:51:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:57,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 194 [2025-03-17 05:51:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:57,889 INFO L225 Difference]: With dead ends: 981 [2025-03-17 05:51:57,889 INFO L226 Difference]: Without dead ends: 521 [2025-03-17 05:51:57,890 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:51:57,890 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 126 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:57,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 413 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:57,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-17 05:51:57,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-03-17 05:51:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 444 states have (on average 1.1103603603603605) internal successors, (493), 447 states have internal predecessors, (493), 51 states have call successors, (51), 25 states have call predecessors, (51), 25 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 05:51:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 595 transitions. [2025-03-17 05:51:57,980 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 595 transitions. Word has length 194 [2025-03-17 05:51:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:57,980 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 595 transitions. [2025-03-17 05:51:57,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:51:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 595 transitions. [2025-03-17 05:51:57,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 05:51:57,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:57,981 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:57,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-17 05:51:57,982 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:57,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:57,982 INFO L85 PathProgramCache]: Analyzing trace with hash -88321207, now seen corresponding path program 1 times [2025-03-17 05:51:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:57,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753054787] [2025-03-17 05:51:57,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:57,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 05:51:58,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 05:51:58,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:58,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:51:58,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:58,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753054787] [2025-03-17 05:51:58,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753054787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:58,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078740744] [2025-03-17 05:51:58,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:58,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:58,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:58,903 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:58,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 05:51:59,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 05:51:59,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 05:51:59,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:59,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:59,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:51:59,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:59,226 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 72 treesize of output 59 [2025-03-17 05:51:59,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 17 [2025-03-17 05:51:59,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2025-03-17 05:51:59,597 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 65 treesize of output 53 [2025-03-17 05:51:59,637 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 57 treesize of output 37 [2025-03-17 05:51:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:51:59,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:51:59,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078740744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:59,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:59,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 20 [2025-03-17 05:51:59,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874229288] [2025-03-17 05:51:59,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:59,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:51:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:59,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:51:59,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:51:59,681 INFO L87 Difference]: Start difference. First operand 521 states and 595 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:52:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:00,037 INFO L93 Difference]: Finished difference Result 1376 states and 1571 transitions. [2025-03-17 05:52:00,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:52:00,037 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 196 [2025-03-17 05:52:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:00,040 INFO L225 Difference]: With dead ends: 1376 [2025-03-17 05:52:00,040 INFO L226 Difference]: Without dead ends: 916 [2025-03-17 05:52:00,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:52:00,041 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 93 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:00,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1451 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-03-17 05:52:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 913. [2025-03-17 05:52:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 789 states have (on average 1.1102661596958174) internal successors, (876), 795 states have internal predecessors, (876), 81 states have call successors, (81), 42 states have call predecessors, (81), 42 states have return successors, (81), 75 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 05:52:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1038 transitions. [2025-03-17 05:52:00,185 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1038 transitions. Word has length 196 [2025-03-17 05:52:00,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:00,185 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1038 transitions. [2025-03-17 05:52:00,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:52:00,185 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1038 transitions. [2025-03-17 05:52:00,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 05:52:00,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:00,186 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:00,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 05:52:00,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-17 05:52:00,387 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:00,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1895775670, now seen corresponding path program 1 times [2025-03-17 05:52:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:00,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977844422] [2025-03-17 05:52:00,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:00,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:00,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 05:52:00,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 05:52:00,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:00,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:52:00,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:00,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977844422] [2025-03-17 05:52:00,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977844422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:00,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:00,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:52:00,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391834848] [2025-03-17 05:52:00,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:00,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:52:00,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:00,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:52:00,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:00,482 INFO L87 Difference]: Start difference. First operand 913 states and 1038 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:52:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:00,671 INFO L93 Difference]: Finished difference Result 1768 states and 2008 transitions. [2025-03-17 05:52:00,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:52:00,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 196 [2025-03-17 05:52:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:00,674 INFO L225 Difference]: With dead ends: 1768 [2025-03-17 05:52:00,674 INFO L226 Difference]: Without dead ends: 916 [2025-03-17 05:52:00,675 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:52:00,675 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 85 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:00,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 591 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:52:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-03-17 05:52:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 907. [2025-03-17 05:52:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 781 states have (on average 1.1037131882202305) internal successors, (862), 787 states have internal predecessors, (862), 82 states have call successors, (82), 43 states have call predecessors, (82), 43 states have return successors, (82), 76 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 05:52:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1026 transitions. [2025-03-17 05:52:00,828 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1026 transitions. Word has length 196 [2025-03-17 05:52:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:00,828 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1026 transitions. [2025-03-17 05:52:00,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:52:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1026 transitions. [2025-03-17 05:52:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 05:52:00,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:00,829 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:00,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-17 05:52:00,830 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:00,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:00,830 INFO L85 PathProgramCache]: Analyzing trace with hash 35752040, now seen corresponding path program 1 times [2025-03-17 05:52:00,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:00,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191650327] [2025-03-17 05:52:00,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:00,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:00,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 05:52:00,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 05:52:00,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:00,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:52:00,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:00,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191650327] [2025-03-17 05:52:00,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191650327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:00,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:00,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:52:00,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733920131] [2025-03-17 05:52:00,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:00,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:52:00,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:00,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:52:00,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:00,917 INFO L87 Difference]: Start difference. First operand 907 states and 1026 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:52:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:01,113 INFO L93 Difference]: Finished difference Result 1754 states and 1984 transitions. [2025-03-17 05:52:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:52:01,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 196 [2025-03-17 05:52:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:01,116 INFO L225 Difference]: With dead ends: 1754 [2025-03-17 05:52:01,116 INFO L226 Difference]: Without dead ends: 914 [2025-03-17 05:52:01,117 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:52:01,117 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 86 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:01,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 896 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-17 05:52:01,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 759. [2025-03-17 05:52:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 679 states have (on average 1.101620029455081) internal successors, (748), 682 states have internal predecessors, (748), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:52:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 852 transitions. [2025-03-17 05:52:01,208 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 852 transitions. Word has length 196 [2025-03-17 05:52:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:01,208 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 852 transitions. [2025-03-17 05:52:01,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:52:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 852 transitions. [2025-03-17 05:52:01,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 05:52:01,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:01,209 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:01,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-17 05:52:01,209 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:01,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1771702423, now seen corresponding path program 1 times [2025-03-17 05:52:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:01,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215344816] [2025-03-17 05:52:01,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:01,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:01,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 05:52:01,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 05:52:01,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:01,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:01,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:52:01,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:01,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215344816] [2025-03-17 05:52:01,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215344816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:01,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:01,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:52:01,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789356610] [2025-03-17 05:52:01,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:01,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:52:01,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:01,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:52:01,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:52:01,619 INFO L87 Difference]: Start difference. First operand 759 states and 852 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:52:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:01,861 INFO L93 Difference]: Finished difference Result 1699 states and 1917 transitions. [2025-03-17 05:52:01,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:52:01,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 196 [2025-03-17 05:52:01,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:01,864 INFO L225 Difference]: With dead ends: 1699 [2025-03-17 05:52:01,864 INFO L226 Difference]: Without dead ends: 1007 [2025-03-17 05:52:01,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:52:01,865 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 127 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 2228 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:01,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 2228 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-03-17 05:52:01,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 747. [2025-03-17 05:52:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 667 states have (on average 1.0989505247376312) internal successors, (733), 670 states have internal predecessors, (733), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:52:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 837 transitions. [2025-03-17 05:52:01,957 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 837 transitions. Word has length 196 [2025-03-17 05:52:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:01,957 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 837 transitions. [2025-03-17 05:52:01,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:52:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 837 transitions. [2025-03-17 05:52:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 05:52:01,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:01,958 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:01,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-17 05:52:01,958 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:01,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:01,958 INFO L85 PathProgramCache]: Analyzing trace with hash 310783395, now seen corresponding path program 1 times [2025-03-17 05:52:01,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:01,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686502461] [2025-03-17 05:52:01,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:01,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:01,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 05:52:01,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 05:52:01,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:01,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:52:02,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:02,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686502461] [2025-03-17 05:52:02,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686502461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:02,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:02,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:52:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134838311] [2025-03-17 05:52:02,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:02,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:52:02,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:02,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:52:02,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:52:02,409 INFO L87 Difference]: Start difference. First operand 747 states and 837 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:52:02,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:02,781 INFO L93 Difference]: Finished difference Result 982 states and 1091 transitions. [2025-03-17 05:52:02,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:52:02,782 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 198 [2025-03-17 05:52:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:02,785 INFO L225 Difference]: With dead ends: 982 [2025-03-17 05:52:02,785 INFO L226 Difference]: Without dead ends: 980 [2025-03-17 05:52:02,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:52:02,786 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 162 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:02,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1110 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2025-03-17 05:52:02,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 930. [2025-03-17 05:52:02,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 850 states have (on average 1.088235294117647) internal successors, (925), 853 states have internal predecessors, (925), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:52:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1029 transitions. [2025-03-17 05:52:02,884 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1029 transitions. Word has length 198 [2025-03-17 05:52:02,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:02,884 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1029 transitions. [2025-03-17 05:52:02,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:52:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1029 transitions. [2025-03-17 05:52:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 05:52:02,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:02,885 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:02,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-17 05:52:02,886 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:02,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:02,886 INFO L85 PathProgramCache]: Analyzing trace with hash 528008744, now seen corresponding path program 1 times [2025-03-17 05:52:02,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:02,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943304076] [2025-03-17 05:52:02,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:02,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:02,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 05:52:02,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 05:52:02,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:02,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:52:03,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:03,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943304076] [2025-03-17 05:52:03,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943304076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:52:03,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258675340] [2025-03-17 05:52:03,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:03,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:52:03,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:52:03,227 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:52:03,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 05:52:03,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 05:52:03,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 05:52:03,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:03,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:03,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 05:52:03,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:52:03,566 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:52:03,699 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 11 [2025-03-17 05:52:03,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 05:52:03,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 13 proven. 543 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2025-03-17 05:52:03,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:52:03,896 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 27 treesize of output 23 [2025-03-17 05:52:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:52:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258675340] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:52:03,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:52:03,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 16 [2025-03-17 05:52:03,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636307761] [2025-03-17 05:52:03,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:52:03,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:52:03,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:03,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:52:03,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:52:03,941 INFO L87 Difference]: Start difference. First operand 930 states and 1029 transitions. Second operand has 16 states, 14 states have (on average 7.642857142857143) internal successors, (107), 16 states have internal predecessors, (107), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) [2025-03-17 05:52:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:04,645 INFO L93 Difference]: Finished difference Result 2189 states and 2431 transitions. [2025-03-17 05:52:04,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 05:52:04,645 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.642857142857143) internal successors, (107), 16 states have internal predecessors, (107), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) Word has length 200 [2025-03-17 05:52:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:04,649 INFO L225 Difference]: With dead ends: 2189 [2025-03-17 05:52:04,649 INFO L226 Difference]: Without dead ends: 1326 [2025-03-17 05:52:04,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 395 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=392, Invalid=1168, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 05:52:04,650 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 384 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:04,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1308 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:52:04,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-03-17 05:52:04,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 720. [2025-03-17 05:52:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 640 states have (on average 1.0828125) internal successors, (693), 643 states have internal predecessors, (693), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:52:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 797 transitions. [2025-03-17 05:52:04,757 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 797 transitions. Word has length 200 [2025-03-17 05:52:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:04,757 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 797 transitions. [2025-03-17 05:52:04,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.642857142857143) internal successors, (107), 16 states have internal predecessors, (107), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) [2025-03-17 05:52:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 797 transitions. [2025-03-17 05:52:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 05:52:04,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:04,758 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:04,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 05:52:04,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-03-17 05:52:04,960 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:04,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:04,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1891566619, now seen corresponding path program 1 times [2025-03-17 05:52:04,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:04,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103159617] [2025-03-17 05:52:04,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:04,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:04,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 05:52:04,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 05:52:04,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:04,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:52:05,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:05,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103159617] [2025-03-17 05:52:05,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103159617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:05,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:05,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:52:05,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720902717] [2025-03-17 05:52:05,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:05,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:52:05,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:05,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:52:05,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:52:05,614 INFO L87 Difference]: Start difference. First operand 720 states and 797 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:52:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:06,004 INFO L93 Difference]: Finished difference Result 730 states and 806 transitions. [2025-03-17 05:52:06,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:52:06,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 200 [2025-03-17 05:52:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:06,007 INFO L225 Difference]: With dead ends: 730 [2025-03-17 05:52:06,007 INFO L226 Difference]: Without dead ends: 728 [2025-03-17 05:52:06,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:52:06,008 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 208 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:06,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1408 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:52:06,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2025-03-17 05:52:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 721. [2025-03-17 05:52:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 641 states have (on average 1.0826833073322932) internal successors, (694), 644 states have internal predecessors, (694), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:52:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 798 transitions. [2025-03-17 05:52:06,101 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 798 transitions. Word has length 200 [2025-03-17 05:52:06,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:06,102 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 798 transitions. [2025-03-17 05:52:06,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:52:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 798 transitions. [2025-03-17 05:52:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 05:52:06,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:06,103 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:06,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-17 05:52:06,103 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:06,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:06,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1004062938, now seen corresponding path program 1 times [2025-03-17 05:52:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:06,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142950730] [2025-03-17 05:52:06,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:06,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:06,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 05:52:06,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 05:52:06,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:06,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 05:52:06,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:06,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142950730] [2025-03-17 05:52:06,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142950730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:52:06,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:52:06,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:52:06,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357695774] [2025-03-17 05:52:06,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:52:06,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:52:06,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:06,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:52:06,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:52:06,283 INFO L87 Difference]: Start difference. First operand 721 states and 798 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:52:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:06,411 INFO L93 Difference]: Finished difference Result 1372 states and 1518 transitions. [2025-03-17 05:52:06,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:52:06,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 200 [2025-03-17 05:52:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:06,414 INFO L225 Difference]: With dead ends: 1372 [2025-03-17 05:52:06,414 INFO L226 Difference]: Without dead ends: 718 [2025-03-17 05:52:06,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:52:06,415 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 36 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:06,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 581 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:52:06,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-03-17 05:52:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 716. [2025-03-17 05:52:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 636 states have (on average 1.078616352201258) internal successors, (686), 639 states have internal predecessors, (686), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:52:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 790 transitions. [2025-03-17 05:52:06,535 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 790 transitions. Word has length 200 [2025-03-17 05:52:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:06,535 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 790 transitions. [2025-03-17 05:52:06,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 05:52:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 790 transitions. [2025-03-17 05:52:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 05:52:06,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:06,537 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:06,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-17 05:52:06,537 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:06,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:06,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1380485147, now seen corresponding path program 1 times [2025-03-17 05:52:06,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:06,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007116679] [2025-03-17 05:52:06,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:06,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:06,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 05:52:06,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 05:52:06,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:06,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:52:06,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:06,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007116679] [2025-03-17 05:52:06,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007116679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:52:06,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897747105] [2025-03-17 05:52:06,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:06,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:52:06,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:52:06,866 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:52:06,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 05:52:07,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 05:52:07,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 05:52:07,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:07,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:07,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 05:52:07,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:52:07,239 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:52:07,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-17 05:52:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 493 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-17 05:52:07,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:52:07,591 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 27 treesize of output 23 [2025-03-17 05:52:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:52:07,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897747105] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:52:07,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:52:07,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 16 [2025-03-17 05:52:07,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324088990] [2025-03-17 05:52:07,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:52:07,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:52:07,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:07,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:52:07,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:52:07,627 INFO L87 Difference]: Start difference. First operand 716 states and 790 transitions. Second operand has 16 states, 13 states have (on average 8.0) internal successors, (104), 16 states have internal predecessors, (104), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) [2025-03-17 05:52:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:08,065 INFO L93 Difference]: Finished difference Result 1249 states and 1377 transitions. [2025-03-17 05:52:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:52:08,066 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.0) internal successors, (104), 16 states have internal predecessors, (104), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) Word has length 200 [2025-03-17 05:52:08,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:08,068 INFO L225 Difference]: With dead ends: 1249 [2025-03-17 05:52:08,068 INFO L226 Difference]: Without dead ends: 600 [2025-03-17 05:52:08,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 395 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:52:08,070 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 567 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:08,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 902 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:52:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-17 05:52:08,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 533. [2025-03-17 05:52:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 473 states have (on average 1.080338266384778) internal successors, (511), 474 states have internal predecessors, (511), 38 states have call successors, (38), 21 states have call predecessors, (38), 21 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:52:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 587 transitions. [2025-03-17 05:52:08,188 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 587 transitions. Word has length 200 [2025-03-17 05:52:08,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:08,189 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 587 transitions. [2025-03-17 05:52:08,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.0) internal successors, (104), 16 states have internal predecessors, (104), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) [2025-03-17 05:52:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 587 transitions. [2025-03-17 05:52:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 05:52:08,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:52:08,190 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:08,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 05:52:08,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-03-17 05:52:08,391 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:52:08,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:52:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1073412281, now seen corresponding path program 1 times [2025-03-17 05:52:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:52:08,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625035775] [2025-03-17 05:52:08,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:08,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:52:08,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 05:52:08,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 05:52:08,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:08,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:52:08,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:52:08,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625035775] [2025-03-17 05:52:08,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625035775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:52:08,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494777368] [2025-03-17 05:52:08,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:52:08,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:52:08,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:52:08,626 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:52:08,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 05:52:08,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 05:52:08,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 05:52:08,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:08,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:08,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:52:08,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:52:08,951 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:52:09,100 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 23 [2025-03-17 05:52:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 17 proven. 411 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2025-03-17 05:52:09,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:52:09,266 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 27 treesize of output 23 [2025-03-17 05:52:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 05:52:09,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494777368] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:52:09,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:52:09,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2025-03-17 05:52:09,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720770014] [2025-03-17 05:52:09,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:52:09,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:52:09,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:52:09,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:52:09,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:52:09,294 INFO L87 Difference]: Start difference. First operand 533 states and 587 transitions. Second operand has 13 states, 11 states have (on average 9.454545454545455) internal successors, (104), 13 states have internal predecessors, (104), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) [2025-03-17 05:52:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:52:09,600 INFO L93 Difference]: Finished difference Result 787 states and 864 transitions. [2025-03-17 05:52:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:52:09,601 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 9.454545454545455) internal successors, (104), 13 states have internal predecessors, (104), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) Word has length 200 [2025-03-17 05:52:09,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:52:09,602 INFO L225 Difference]: With dead ends: 787 [2025-03-17 05:52:09,602 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 05:52:09,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 396 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:52:09,603 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 225 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:52:09,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 469 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:52:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 05:52:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 05:52:09,603 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:52:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 05:52:09,604 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 200 [2025-03-17 05:52:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:52:09,604 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 05:52:09,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 9.454545454545455) internal successors, (104), 13 states have internal predecessors, (104), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) [2025-03-17 05:52:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 05:52:09,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 05:52:09,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:52:09,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 05:52:09,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-03-17 05:52:09,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:52:09,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.