./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5b8ad5d8740269626905d9d5a2468afdc53741ffbc53080bd6ac9ee1933c3998 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:57:27,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:57:27,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:57:27,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:57:27,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:57:27,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:57:27,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:57:27,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:57:27,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:57:27,874 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:57:27,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:57:27,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:57:27,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:57:27,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:57:27,875 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:57:27,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:57:27,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:57:27,875 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:57:27,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:57:27,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:57:27,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:57:27,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:57:27,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:57:27,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:57:27,878 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:57:27,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:57:27,878 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:57:27,878 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:57:27,878 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:57:27,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:57:27,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:57:27,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:57:27,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:57:27,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:57:27,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:57:27,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:57:27,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:57:27,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:57:27,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:57:27,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:57:27,879 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:57:27,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:57:27,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:57:27,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:57:27,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:57:27,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:57:27,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:57:27,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:57:27,880 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-jdk21/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 -> 5b8ad5d8740269626905d9d5a2468afdc53741ffbc53080bd6ac9ee1933c3998 [2025-01-09 02:57:28,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:57:28,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:57:28,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:57:28,141 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:57:28,141 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:57:28,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2025-01-09 02:57:29,391 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c453a1bcf/59253eddc16144b7800b7fa7b83a789a/FLAG192bf1077 [2025-01-09 02:57:29,758 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:57:29,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2025-01-09 02:57:29,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c453a1bcf/59253eddc16144b7800b7fa7b83a789a/FLAG192bf1077 [2025-01-09 02:57:29,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c453a1bcf/59253eddc16144b7800b7fa7b83a789a [2025-01-09 02:57:29,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:57:29,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:57:29,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:57:29,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:57:29,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:57:29,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:57:29" (1/1) ... [2025-01-09 02:57:29,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae76050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:29, skipping insertion in model container [2025-01-09 02:57:29,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:57:29" (1/1) ... [2025-01-09 02:57:30,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:57:30,187 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1000,1013] [2025-01-09 02:57:30,193 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1215,1228] [2025-01-09 02:57:30,475 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83573,83586] [2025-01-09 02:57:30,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83794,83807] [2025-01-09 02:57:30,479 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84257,84270] [2025-01-09 02:57:30,481 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84478,84491] [2025-01-09 02:57:30,483 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84801,84814] [2025-01-09 02:57:30,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85022,85035] [2025-01-09 02:57:30,487 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85521,85534] [2025-01-09 02:57:30,489 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85742,85755] [2025-01-09 02:57:30,491 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86050,86063] [2025-01-09 02:57:30,493 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86271,86284] [2025-01-09 02:57:30,494 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86594,86607] [2025-01-09 02:57:30,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86815,86828] [2025-01-09 02:57:30,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87258,87271] [2025-01-09 02:57:30,499 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87479,87492] [2025-01-09 02:57:30,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:57:30,525 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:57:30,535 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1000,1013] [2025-01-09 02:57:30,535 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1215,1228] [2025-01-09 02:57:30,704 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83573,83586] [2025-01-09 02:57:30,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83794,83807] [2025-01-09 02:57:30,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84257,84270] [2025-01-09 02:57:30,709 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84478,84491] [2025-01-09 02:57:30,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84801,84814] [2025-01-09 02:57:30,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85022,85035] [2025-01-09 02:57:30,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85521,85534] [2025-01-09 02:57:30,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85742,85755] [2025-01-09 02:57:30,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86050,86063] [2025-01-09 02:57:30,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86271,86284] [2025-01-09 02:57:30,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86594,86607] [2025-01-09 02:57:30,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86815,86828] [2025-01-09 02:57:30,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87258,87271] [2025-01-09 02:57:30,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87479,87492] [2025-01-09 02:57:30,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:57:30,745 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:57:30,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30 WrapperNode [2025-01-09 02:57:30,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:57:30,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:57:30,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:57:30,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:57:30,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30" (1/1) ... [2025-01-09 02:57:30,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30" (1/1) ... [2025-01-09 02:57:30,864 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3587 [2025-01-09 02:57:30,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:57:30,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:57:30,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:57:30,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:57:30,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30" (1/1) ... [2025-01-09 02:57:30,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30" (1/1) ... [2025-01-09 02:57:30,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30" (1/1) ... [2025-01-09 02:57:30,928 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 02:57:30,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30" (1/1) ... [2025-01-09 02:57:30,932 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30" (1/1) ... [2025-01-09 02:57:30,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30" (1/1) ... [2025-01-09 02:57:30,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30" (1/1) ... [2025-01-09 02:57:30,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30" (1/1) ... [2025-01-09 02:57:31,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30" (1/1) ... [2025-01-09 02:57:31,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30" (1/1) ... [2025-01-09 02:57:31,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:57:31,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:57:31,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:57:31,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:57:31,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30" (1/1) ... [2025-01-09 02:57:31,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:57:31,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:57:31,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:57:31,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:57:31,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:57:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:57:31,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:57:31,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:57:31,346 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:57:31,347 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:57:32,844 INFO L? ?]: Removed 1160 outVars from TransFormulas that were not future-live. [2025-01-09 02:57:32,844 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:57:32,868 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:57:32,868 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:57:32,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:57:32 BoogieIcfgContainer [2025-01-09 02:57:32,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:57:32,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:57:32,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:57:32,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:57:32,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:57:29" (1/3) ... [2025-01-09 02:57:32,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50af13b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:57:32, skipping insertion in model container [2025-01-09 02:57:32,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:30" (2/3) ... [2025-01-09 02:57:32,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50af13b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:57:32, skipping insertion in model container [2025-01-09 02:57:32,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:57:32" (3/3) ... [2025-01-09 02:57:32,875 INFO L128 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2025-01-09 02:57:32,888 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:57:32,889 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG apache-get-tag.i.p+sep-reducer.c that has 1 procedures, 475 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-01-09 02:57:32,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:57:32,988 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;@300caac9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:57:32,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 02:57:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 475 states, 458 states have (on average 1.9672489082969433) internal successors, (901), 474 states have internal predecessors, (901), 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-01-09 02:57:32,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 02:57:32,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:32,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:32,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:33,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:33,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2025-01-09 02:57:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:33,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206541329] [2025-01-09 02:57:33,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:33,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:33,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 02:57:33,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 02:57:33,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:33,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:33,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:33,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206541329] [2025-01-09 02:57:33,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206541329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:33,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:33,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:57:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133744145] [2025-01-09 02:57:33,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:33,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:57:33,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:33,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:57:33,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:57:33,315 INFO L87 Difference]: Start difference. First operand has 475 states, 458 states have (on average 1.9672489082969433) internal successors, (901), 474 states have internal predecessors, (901), 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) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-01-09 02:57:34,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:34,340 INFO L93 Difference]: Finished difference Result 479 states and 904 transitions. [2025-01-09 02:57:34,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:57:34,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2025-01-09 02:57:34,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:34,351 INFO L225 Difference]: With dead ends: 479 [2025-01-09 02:57:34,351 INFO L226 Difference]: Without dead ends: 297 [2025-01-09 02:57:34,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:34,361 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 703 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:34,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 713 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 02:57:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-01-09 02:57:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-01-09 02:57:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 282 states have (on average 1.2765957446808511) internal successors, (360), 296 states have internal predecessors, (360), 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-01-09 02:57:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2025-01-09 02:57:34,414 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 7 [2025-01-09 02:57:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:34,415 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2025-01-09 02:57:34,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-01-09 02:57:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2025-01-09 02:57:34,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 02:57:34,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:34,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:34,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:57:34,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:34,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:34,417 INFO L85 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2025-01-09 02:57:34,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:34,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978572942] [2025-01-09 02:57:34,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:34,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 02:57:34,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 02:57:34,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:34,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:34,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:34,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978572942] [2025-01-09 02:57:34,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978572942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:34,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:34,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:57:34,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928085300] [2025-01-09 02:57:34,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:34,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:57:34,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:34,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:57:34,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:34,594 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-01-09 02:57:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:34,956 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2025-01-09 02:57:34,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:57:34,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) Word has length 8 [2025-01-09 02:57:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:34,958 INFO L225 Difference]: With dead ends: 297 [2025-01-09 02:57:34,958 INFO L226 Difference]: Without dead ends: 292 [2025-01-09 02:57:34,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:34,959 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 14 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:34,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 728 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:57:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-01-09 02:57:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-01-09 02:57:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 278 states have (on average 1.0611510791366907) internal successors, (295), 291 states have internal predecessors, (295), 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-01-09 02:57:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2025-01-09 02:57:34,980 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 8 [2025-01-09 02:57:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:34,980 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2025-01-09 02:57:34,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-01-09 02:57:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2025-01-09 02:57:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-01-09 02:57:34,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:34,990 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 02:57:34,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:57:34,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:34,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:34,991 INFO L85 PathProgramCache]: Analyzing trace with hash 943449897, now seen corresponding path program 1 times [2025-01-09 02:57:34,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:34,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241280971] [2025-01-09 02:57:34,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:34,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:35,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-01-09 02:57:35,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-01-09 02:57:35,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:35,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:39,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241280971] [2025-01-09 02:57:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241280971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:39,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:39,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2025-01-09 02:57:39,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252790590] [2025-01-09 02:57:39,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:39,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-01-09 02:57:39,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:39,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-01-09 02:57:39,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2025-01-09 02:57:39,954 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 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-01-09 02:57:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:40,792 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2025-01-09 02:57:40,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-09 02:57:40,793 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 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) Word has length 244 [2025-01-09 02:57:40,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:40,795 INFO L225 Difference]: With dead ends: 292 [2025-01-09 02:57:40,795 INFO L226 Difference]: Without dead ends: 290 [2025-01-09 02:57:40,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2025-01-09 02:57:40,798 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 117 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:40,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 116 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 02:57:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-01-09 02:57:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-01-09 02:57:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 277 states have (on average 1.0577617328519855) internal successors, (293), 289 states have internal predecessors, (293), 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-01-09 02:57:40,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2025-01-09 02:57:40,805 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 244 [2025-01-09 02:57:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:40,806 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2025-01-09 02:57:40,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 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-01-09 02:57:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2025-01-09 02:57:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-01-09 02:57:40,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:40,809 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 02:57:40,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:57:40,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:40,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:40,810 INFO L85 PathProgramCache]: Analyzing trace with hash -817818172, now seen corresponding path program 1 times [2025-01-09 02:57:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:40,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472658589] [2025-01-09 02:57:40,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:40,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:40,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-01-09 02:57:41,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-01-09 02:57:41,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:41,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:47,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:47,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472658589] [2025-01-09 02:57:47,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472658589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:47,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:47,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:57:47,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363354647] [2025-01-09 02:57:47,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:47,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:57:47,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:47,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:57:47,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:57:47,120 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 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-01-09 02:57:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:47,457 INFO L93 Difference]: Finished difference Result 290 states and 293 transitions. [2025-01-09 02:57:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:57:47,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 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) Word has length 245 [2025-01-09 02:57:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:47,460 INFO L225 Difference]: With dead ends: 290 [2025-01-09 02:57:47,460 INFO L226 Difference]: Without dead ends: 288 [2025-01-09 02:57:47,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:57:47,461 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 138 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:47,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 83 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:57:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-01-09 02:57:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-01-09 02:57:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 276 states have (on average 1.0543478260869565) internal successors, (291), 287 states have internal predecessors, (291), 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-01-09 02:57:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 291 transitions. [2025-01-09 02:57:47,476 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 291 transitions. Word has length 245 [2025-01-09 02:57:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:47,476 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 291 transitions. [2025-01-09 02:57:47,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 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-01-09 02:57:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 291 transitions. [2025-01-09 02:57:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-01-09 02:57:47,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:47,479 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 02:57:47,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:57:47,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:47,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:47,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1734300147, now seen corresponding path program 1 times [2025-01-09 02:57:47,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:47,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591538836] [2025-01-09 02:57:47,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:47,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:47,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-09 02:57:47,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-09 02:57:47,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:47,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:50,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:50,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591538836] [2025-01-09 02:57:50,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591538836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:50,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:50,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2025-01-09 02:57:50,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287635421] [2025-01-09 02:57:50,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:50,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-01-09 02:57:50,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:50,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-01-09 02:57:50,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1895, Invalid=2137, Unknown=0, NotChecked=0, Total=4032 [2025-01-09 02:57:50,197 INFO L87 Difference]: Start difference. First operand 288 states and 291 transitions. Second operand has 64 states, 64 states have (on average 3.875) internal successors, (248), 64 states have internal predecessors, (248), 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-01-09 02:57:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:50,881 INFO L93 Difference]: Finished difference Result 291 states and 294 transitions. [2025-01-09 02:57:50,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-01-09 02:57:50,882 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.875) internal successors, (248), 64 states have internal predecessors, (248), 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) Word has length 248 [2025-01-09 02:57:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:50,885 INFO L225 Difference]: With dead ends: 291 [2025-01-09 02:57:50,885 INFO L226 Difference]: Without dead ends: 289 [2025-01-09 02:57:50,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 02:57:50,890 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 226 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:50,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 126 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:57:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-01-09 02:57:50,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2025-01-09 02:57:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 275 states have (on average 1.050909090909091) internal successors, (289), 285 states have internal predecessors, (289), 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-01-09 02:57:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2025-01-09 02:57:50,899 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 248 [2025-01-09 02:57:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:50,900 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2025-01-09 02:57:50,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.875) internal successors, (248), 64 states have internal predecessors, (248), 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-01-09 02:57:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2025-01-09 02:57:50,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-01-09 02:57:50,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:50,905 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 02:57:50,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 02:57:50,905 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:50,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:50,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2071264176, now seen corresponding path program 1 times [2025-01-09 02:57:50,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:50,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980308722] [2025-01-09 02:57:50,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:50,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:50,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 02:57:51,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 02:57:51,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:51,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:54,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:54,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980308722] [2025-01-09 02:57:54,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980308722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:54,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:54,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:57:54,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173396820] [2025-01-09 02:57:54,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:54,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:57:54,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:54,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:57:54,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:57:54,970 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 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-01-09 02:57:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:55,343 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2025-01-09 02:57:55,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:57:55,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 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) Word has length 249 [2025-01-09 02:57:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:55,345 INFO L225 Difference]: With dead ends: 286 [2025-01-09 02:57:55,345 INFO L226 Difference]: Without dead ends: 284 [2025-01-09 02:57:55,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:57:55,346 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:55,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 97 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 02:57:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-01-09 02:57:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-01-09 02:57:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 274 states have (on average 1.0474452554744527) internal successors, (287), 283 states have internal predecessors, (287), 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-01-09 02:57:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 287 transitions. [2025-01-09 02:57:55,352 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 287 transitions. Word has length 249 [2025-01-09 02:57:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:55,353 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 287 transitions. [2025-01-09 02:57:55,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 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-01-09 02:57:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 287 transitions. [2025-01-09 02:57:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-09 02:57:55,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:55,355 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 02:57:55,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 02:57:55,356 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:55,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:55,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1914822156, now seen corresponding path program 1 times [2025-01-09 02:57:55,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:55,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370903088] [2025-01-09 02:57:55,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:55,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:55,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-09 02:57:55,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-09 02:57:55,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:55,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:55,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:55,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370903088] [2025-01-09 02:57:55,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370903088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:55,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:55,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:57:55,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698261791] [2025-01-09 02:57:55,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:55,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:57:55,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:55,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:57:55,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:57:55,704 INFO L87 Difference]: Start difference. First operand 284 states and 287 transitions. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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-01-09 02:57:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:55,852 INFO L93 Difference]: Finished difference Result 284 states and 287 transitions. [2025-01-09 02:57:55,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:57:55,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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) Word has length 251 [2025-01-09 02:57:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:55,853 INFO L225 Difference]: With dead ends: 284 [2025-01-09 02:57:55,853 INFO L226 Difference]: Without dead ends: 282 [2025-01-09 02:57:55,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:55,854 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:55,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 314 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-09 02:57:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-01-09 02:57:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 273 states have (on average 1.043956043956044) internal successors, (285), 281 states have internal predecessors, (285), 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-01-09 02:57:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2025-01-09 02:57:55,859 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 251 [2025-01-09 02:57:55,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:55,860 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2025-01-09 02:57:55,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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-01-09 02:57:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2025-01-09 02:57:55,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-01-09 02:57:55,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:55,862 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 02:57:55,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 02:57:55,862 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:55,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:55,863 INFO L85 PathProgramCache]: Analyzing trace with hash 770061441, now seen corresponding path program 1 times [2025-01-09 02:57:55,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:55,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266820414] [2025-01-09 02:57:55,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:55,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-09 02:57:55,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-09 02:57:55,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:55,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:56,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266820414] [2025-01-09 02:57:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266820414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:57:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403754451] [2025-01-09 02:57:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:56,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:57:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:56,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:57:56,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:57:56,075 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 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-01-09 02:57:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:56,269 INFO L93 Difference]: Finished difference Result 282 states and 285 transitions. [2025-01-09 02:57:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:57:56,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 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) Word has length 252 [2025-01-09 02:57:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:56,271 INFO L225 Difference]: With dead ends: 282 [2025-01-09 02:57:56,271 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 02:57:56,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-01-09 02:57:56,272 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 5 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:56,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 574 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:57:56,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 02:57:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-01-09 02:57:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 270 states have (on average 1.0407407407407407) internal successors, (281), 277 states have internal predecessors, (281), 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-01-09 02:57:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2025-01-09 02:57:56,277 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 252 [2025-01-09 02:57:56,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:56,277 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2025-01-09 02:57:56,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 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-01-09 02:57:56,278 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2025-01-09 02:57:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-09 02:57:56,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:56,279 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 02:57:56,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 02:57:56,279 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:56,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:56,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1881027289, now seen corresponding path program 1 times [2025-01-09 02:57:56,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:56,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278489260] [2025-01-09 02:57:56,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:56,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:56,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-01-09 02:57:56,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-01-09 02:57:56,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:56,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:58,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:58,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278489260] [2025-01-09 02:57:58,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278489260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:58,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:58,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2025-01-09 02:57:58,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715448068] [2025-01-09 02:57:58,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:58,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-01-09 02:57:58,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:58,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-01-09 02:57:58,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 02:57:58,585 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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-01-09 02:57:59,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:59,225 INFO L93 Difference]: Finished difference Result 288 states and 292 transitions. [2025-01-09 02:57:59,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-01-09 02:57:59,225 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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) Word has length 253 [2025-01-09 02:57:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:59,226 INFO L225 Difference]: With dead ends: 288 [2025-01-09 02:57:59,226 INFO L226 Difference]: Without dead ends: 286 [2025-01-09 02:57:59,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2025-01-09 02:57:59,228 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 93 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:59,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 97 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:57:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-01-09 02:57:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 276. [2025-01-09 02:57:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 269 states have (on average 1.037174721189591) internal successors, (279), 275 states have internal predecessors, (279), 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-01-09 02:57:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2025-01-09 02:57:59,236 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 253 [2025-01-09 02:57:59,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:59,237 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2025-01-09 02:57:59,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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-01-09 02:57:59,237 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2025-01-09 02:57:59,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-09 02:57:59,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:59,238 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 02:57:59,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 02:57:59,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:59,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:59,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1882751193, now seen corresponding path program 1 times [2025-01-09 02:57:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:59,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129849854] [2025-01-09 02:57:59,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:59,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:59,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-01-09 02:57:59,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-01-09 02:57:59,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:59,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:01,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:01,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129849854] [2025-01-09 02:58:01,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129849854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:01,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:01,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2025-01-09 02:58:01,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303991666] [2025-01-09 02:58:01,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:01,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-01-09 02:58:01,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:01,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-01-09 02:58:01,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 02:58:01,549 INFO L87 Difference]: Start difference. First operand 276 states and 279 transitions. Second operand has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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-01-09 02:58:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:02,203 INFO L93 Difference]: Finished difference Result 286 states and 290 transitions. [2025-01-09 02:58:02,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-01-09 02:58:02,204 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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) Word has length 253 [2025-01-09 02:58:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:02,205 INFO L225 Difference]: With dead ends: 286 [2025-01-09 02:58:02,205 INFO L226 Difference]: Without dead ends: 284 [2025-01-09 02:58:02,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2025-01-09 02:58:02,207 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:02,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 85 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:58:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-01-09 02:58:02,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2025-01-09 02:58:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 268 states have (on average 1.0335820895522387) internal successors, (277), 273 states have internal predecessors, (277), 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-01-09 02:58:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 277 transitions. [2025-01-09 02:58:02,212 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 277 transitions. Word has length 253 [2025-01-09 02:58:02,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:02,212 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 277 transitions. [2025-01-09 02:58:02,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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-01-09 02:58:02,213 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 277 transitions. [2025-01-09 02:58:02,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 02:58:02,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:02,214 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 02:58:02,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 02:58:02,214 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:58:02,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:02,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1817702396, now seen corresponding path program 1 times [2025-01-09 02:58:02,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:02,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285943462] [2025-01-09 02:58:02,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:02,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:02,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 02:58:02,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 02:58:02,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:02,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:06,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:06,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285943462] [2025-01-09 02:58:06,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285943462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:06,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:06,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:58:06,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171591823] [2025-01-09 02:58:06,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:06,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:58:06,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:06,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:58:06,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:58:06,048 INFO L87 Difference]: Start difference. First operand 274 states and 277 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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-01-09 02:58:06,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:06,353 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2025-01-09 02:58:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:58:06,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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) Word has length 254 [2025-01-09 02:58:06,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:06,355 INFO L225 Difference]: With dead ends: 274 [2025-01-09 02:58:06,355 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 02:58:06,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:58:06,356 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 81 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:06,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 45 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:58:06,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 02:58:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-01-09 02:58:06,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.030188679245283) internal successors, (273), 269 states have internal predecessors, (273), 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-01-09 02:58:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 273 transitions. [2025-01-09 02:58:06,361 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 273 transitions. Word has length 254 [2025-01-09 02:58:06,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:06,361 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 273 transitions. [2025-01-09 02:58:06,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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-01-09 02:58:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 273 transitions. [2025-01-09 02:58:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 02:58:06,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:06,362 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 02:58:06,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 02:58:06,363 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:58:06,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1818153234, now seen corresponding path program 1 times [2025-01-09 02:58:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349866104] [2025-01-09 02:58:06,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:06,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 02:58:06,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 02:58:06,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:06,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:08,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:08,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349866104] [2025-01-09 02:58:08,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349866104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:08,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:08,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2025-01-09 02:58:08,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768399299] [2025-01-09 02:58:08,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:08,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-01-09 02:58:08,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:08,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-01-09 02:58:08,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 02:58:08,544 INFO L87 Difference]: Start difference. First operand 270 states and 273 transitions. Second operand has 65 states, 65 states have (on average 3.9076923076923076) internal successors, (254), 65 states have internal predecessors, (254), 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-01-09 02:58:09,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:09,135 INFO L93 Difference]: Finished difference Result 280 states and 284 transitions. [2025-01-09 02:58:09,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-01-09 02:58:09,135 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.9076923076923076) internal successors, (254), 65 states have internal predecessors, (254), 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) Word has length 254 [2025-01-09 02:58:09,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:09,136 INFO L225 Difference]: With dead ends: 280 [2025-01-09 02:58:09,136 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 02:58:09,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2025-01-09 02:58:09,138 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 67 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:09,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 68 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 02:58:09,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 02:58:09,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 268. [2025-01-09 02:58:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 264 states have (on average 1.0265151515151516) internal successors, (271), 267 states have internal predecessors, (271), 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-01-09 02:58:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2025-01-09 02:58:09,143 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 254 [2025-01-09 02:58:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:09,143 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2025-01-09 02:58:09,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.9076923076923076) internal successors, (254), 65 states have internal predecessors, (254), 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-01-09 02:58:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2025-01-09 02:58:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 02:58:09,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:09,145 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 02:58:09,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 02:58:09,145 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:58:09,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:09,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1764261316, now seen corresponding path program 1 times [2025-01-09 02:58:09,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:09,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381340639] [2025-01-09 02:58:09,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:09,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:09,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 02:58:09,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 02:58:09,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:09,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:12,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:12,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381340639] [2025-01-09 02:58:12,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381340639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:12,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:12,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:58:12,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293406499] [2025-01-09 02:58:12,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:12,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:58:12,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:12,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:58:12,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:58:12,770 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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-01-09 02:58:13,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:13,107 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2025-01-09 02:58:13,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:58:13,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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) Word has length 254 [2025-01-09 02:58:13,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:13,109 INFO L225 Difference]: With dead ends: 268 [2025-01-09 02:58:13,109 INFO L226 Difference]: Without dead ends: 266 [2025-01-09 02:58:13,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:58:13,109 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:13,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 42 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:58:13,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-09 02:58:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-01-09 02:58:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 263 states have (on average 1.0228136882129277) internal successors, (269), 265 states have internal predecessors, (269), 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-01-09 02:58:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 269 transitions. [2025-01-09 02:58:13,114 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 269 transitions. Word has length 254 [2025-01-09 02:58:13,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:13,114 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 269 transitions. [2025-01-09 02:58:13,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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-01-09 02:58:13,115 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 269 transitions. [2025-01-09 02:58:13,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-01-09 02:58:13,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:13,116 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 02:58:13,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 02:58:13,116 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:58:13,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:13,117 INFO L85 PathProgramCache]: Analyzing trace with hash 528181598, now seen corresponding path program 1 times [2025-01-09 02:58:13,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:13,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277407927] [2025-01-09 02:58:13,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:13,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:13,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-09 02:58:13,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-09 02:58:13,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:13,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:16,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:16,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277407927] [2025-01-09 02:58:16,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277407927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:16,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:16,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:58:16,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888588692] [2025-01-09 02:58:16,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:16,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:58:16,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:16,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:58:16,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:58:16,845 INFO L87 Difference]: Start difference. First operand 266 states and 269 transitions. Second operand has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 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-01-09 02:58:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:17,168 INFO L93 Difference]: Finished difference Result 266 states and 269 transitions. [2025-01-09 02:58:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:58:17,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 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) Word has length 255 [2025-01-09 02:58:17,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:17,169 INFO L225 Difference]: With dead ends: 266 [2025-01-09 02:58:17,170 INFO L226 Difference]: Without dead ends: 264 [2025-01-09 02:58:17,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:58:17,170 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:17,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 40 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:58:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-09 02:58:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-01-09 02:58:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 262 states have (on average 1.0190839694656488) internal successors, (267), 263 states have internal predecessors, (267), 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-01-09 02:58:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 267 transitions. [2025-01-09 02:58:17,174 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 267 transitions. Word has length 255 [2025-01-09 02:58:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:17,175 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 267 transitions. [2025-01-09 02:58:17,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 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-01-09 02:58:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 267 transitions. [2025-01-09 02:58:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-01-09 02:58:17,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:17,176 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 02:58:17,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 02:58:17,177 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:58:17,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1056764025, now seen corresponding path program 1 times [2025-01-09 02:58:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:17,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222027514] [2025-01-09 02:58:17,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:17,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:17,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-01-09 02:58:17,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-01-09 02:58:17,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:17,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:17,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:17,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222027514] [2025-01-09 02:58:17,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222027514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:17,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:17,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:58:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285951558] [2025-01-09 02:58:17,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:17,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:58:17,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:17,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:58:17,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:58:17,437 INFO L87 Difference]: Start difference. First operand 264 states and 267 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-01-09 02:58:17,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:17,589 INFO L93 Difference]: Finished difference Result 264 states and 267 transitions. [2025-01-09 02:58:17,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:58:17,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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) Word has length 256 [2025-01-09 02:58:17,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:17,591 INFO L225 Difference]: With dead ends: 264 [2025-01-09 02:58:17,591 INFO L226 Difference]: Without dead ends: 262 [2025-01-09 02:58:17,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:58:17,591 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:17,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 276 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:58:17,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-09 02:58:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2025-01-09 02:58:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.0153256704980842) internal successors, (265), 261 states have internal predecessors, (265), 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-01-09 02:58:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 265 transitions. [2025-01-09 02:58:17,598 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 265 transitions. Word has length 256 [2025-01-09 02:58:17,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:17,598 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 265 transitions. [2025-01-09 02:58:17,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-01-09 02:58:17,599 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 265 transitions. [2025-01-09 02:58:17,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-01-09 02:58:17,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:17,600 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 02:58:17,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 02:58:17,600 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:58:17,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:17,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1600059765, now seen corresponding path program 1 times [2025-01-09 02:58:17,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:17,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933708744] [2025-01-09 02:58:17,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:17,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:17,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-01-09 02:58:17,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-01-09 02:58:17,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:17,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:17,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:17,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933708744] [2025-01-09 02:58:17,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933708744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:17,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:17,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:58:17,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977979182] [2025-01-09 02:58:17,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:17,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:58:17,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:17,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:58:17,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:58:17,762 INFO L87 Difference]: Start difference. First operand 262 states and 265 transitions. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 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-01-09 02:58:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:17,959 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2025-01-09 02:58:17,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:58:17,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 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) Word has length 257 [2025-01-09 02:58:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:17,961 INFO L225 Difference]: With dead ends: 262 [2025-01-09 02:58:17,961 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 02:58:17,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-01-09 02:58:17,964 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 3 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:17,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 522 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:58:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 02:58:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 02:58:17,965 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-01-09 02:58:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 02:58:17,965 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 257 [2025-01-09 02:58:17,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:17,965 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 02:58:17,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 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-01-09 02:58:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 02:58:17,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 02:58:17,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2025-01-09 02:58:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2025-01-09 02:58:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2025-01-09 02:58:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2025-01-09 02:58:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2025-01-09 02:58:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2025-01-09 02:58:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2025-01-09 02:58:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2025-01-09 02:58:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2025-01-09 02:58:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2025-01-09 02:58:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2025-01-09 02:58:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2025-01-09 02:58:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2025-01-09 02:58:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2025-01-09 02:58:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2025-01-09 02:58:17,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2025-01-09 02:58:17,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 02:58:17,973 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:17,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 02:58:17,980 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 02:58:17,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:58:17 BoogieIcfgContainer [2025-01-09 02:58:17,988 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 02:58:17,989 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 02:58:17,989 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 02:58:17,989 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 02:58:17,990 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:57:32" (3/4) ... [2025-01-09 02:58:17,992 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 02:58:18,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-01-09 02:58:18,038 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 02:58:18,042 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 02:58:18,045 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 02:58:18,231 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 02:58:18,232 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 02:58:18,232 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 02:58:18,232 INFO L158 Benchmark]: Toolchain (without parser) took 48261.21ms. Allocated memory was 167.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 120.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 796.6MB. Max. memory is 16.1GB. [2025-01-09 02:58:18,233 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:58:18,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 774.33ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 64.9MB in the end (delta: 55.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 02:58:18,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.31ms. Allocated memory is still 167.8MB. Free memory was 64.9MB in the beginning and 53.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:58:18,233 INFO L158 Benchmark]: Boogie Preprocessor took 157.36ms. Allocated memory is still 167.8MB. Free memory was 53.1MB in the beginning and 40.6MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:58:18,234 INFO L158 Benchmark]: RCFGBuilder took 1844.47ms. Allocated memory is still 167.8MB. Free memory was 40.6MB in the beginning and 48.8MB in the end (delta: -8.2MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2025-01-09 02:58:18,234 INFO L158 Benchmark]: TraceAbstraction took 45118.53ms. Allocated memory was 167.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 48.8MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 689.7MB. Max. memory is 16.1GB. [2025-01-09 02:58:18,234 INFO L158 Benchmark]: Witness Printer took 242.54ms. Allocated memory is still 2.1GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 02:58:18,237 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 774.33ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 64.9MB in the end (delta: 55.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.31ms. Allocated memory is still 167.8MB. Free memory was 64.9MB in the beginning and 53.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 157.36ms. Allocated memory is still 167.8MB. Free memory was 53.1MB in the beginning and 40.6MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1844.47ms. Allocated memory is still 167.8MB. Free memory was 40.6MB in the beginning and 48.8MB in the end (delta: -8.2MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 45118.53ms. Allocated memory was 167.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 48.8MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 689.7MB. Max. memory is 16.1GB. * Witness Printer took 242.54ms. Allocated memory is still 2.1GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 41]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 53]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4678]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4690]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4714]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4726]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4743]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4755]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4783]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4795]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4811]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4823]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4854]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4866]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4893]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4905]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 475 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 45.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1657 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1657 mSDsluCounter, 3926 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2171 mSDsCounter, 383 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14074 IncrementalHoareTripleChecker+Invalid, 14457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 383 mSolverCounterUnsat, 1755 mSDtfsCounter, 14074 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 977 GetRequests, 610 SyntacticMatches, 5 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=475occurred in iteration=0, InterpolantAutomatonStates: 371, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 35.7s InterpolantComputationTime, 3540 NumberOfCodeBlocks, 3540 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3524 ConstructedInterpolants, 0 QuantifiedInterpolants, 10148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 02:58:18,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE