./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:50:27,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:50:27,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:50:27,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:50:27,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:50:27,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:50:27,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:50:27,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:50:27,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:50:27,086 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:50:27,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:50:27,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:50:27,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:50:27,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:50:27,086 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:50:27,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:50:27,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:50:27,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:50:27,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:50:27,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:50:27,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:50:27,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:50:27,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:50:27,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:50:27,089 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:50:27,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:50:27,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:50:27,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:50:27,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:50:27,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:50:27,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:50:27,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:50:27,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:50:27,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:50:27,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:50:27,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:50:27,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:50:27,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:50:27,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:50:27,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:50:27,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:50:27,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:50:27,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:50:27,091 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 [2025-03-16 17:50:27,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:50:27,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:50:27,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:50:27,326 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:50:27,326 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:50:27,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2025-03-16 17:50:28,491 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315013bea/c0b904dfabbc4d26a65925620664f174/FLAG85ac73524 [2025-03-16 17:50:28,706 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:50:28,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2025-03-16 17:50:28,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315013bea/c0b904dfabbc4d26a65925620664f174/FLAG85ac73524 [2025-03-16 17:50:28,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315013bea/c0b904dfabbc4d26a65925620664f174 [2025-03-16 17:50:28,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:50:28,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:50:28,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:50:28,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:50:28,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:50:28,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19bc57e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28, skipping insertion in model container [2025-03-16 17:50:28,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:50:28,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2025-03-16 17:50:28,848 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2025-03-16 17:50:28,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2025-03-16 17:50:28,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2025-03-16 17:50:28,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2025-03-16 17:50:28,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2025-03-16 17:50:28,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2025-03-16 17:50:28,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2025-03-16 17:50:28,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2025-03-16 17:50:28,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2025-03-16 17:50:28,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2025-03-16 17:50:28,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2025-03-16 17:50:28,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2025-03-16 17:50:28,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2025-03-16 17:50:28,870 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2025-03-16 17:50:28,872 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2025-03-16 17:50:28,874 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2025-03-16 17:50:28,874 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2025-03-16 17:50:28,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:50:28,885 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:50:28,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2025-03-16 17:50:28,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2025-03-16 17:50:28,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2025-03-16 17:50:28,899 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2025-03-16 17:50:28,899 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2025-03-16 17:50:28,900 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2025-03-16 17:50:28,902 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2025-03-16 17:50:28,903 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2025-03-16 17:50:28,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2025-03-16 17:50:28,910 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2025-03-16 17:50:28,910 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2025-03-16 17:50:28,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2025-03-16 17:50:28,912 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2025-03-16 17:50:28,912 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2025-03-16 17:50:28,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2025-03-16 17:50:28,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2025-03-16 17:50:28,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2025-03-16 17:50:28,916 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2025-03-16 17:50:28,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:50:28,925 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:50:28,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28 WrapperNode [2025-03-16 17:50:28,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:50:28,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:50:28,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:50:28,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:50:28,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,954 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 278 [2025-03-16 17:50:28,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:50:28,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:50:28,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:50:28,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:50:28,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,983 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-03-16 17:50:28,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:50:29,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:50:29,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:50:29,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:50:29,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:29,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:50:29,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:50:29,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 17:50:29,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 17:50:29,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:50:29,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:50:29,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:50:29,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:50:29,096 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:50:29,097 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:50:29,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L192: havoc main_~main____CPAchecker_TMP_7~0#1;havoc main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1;havoc main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1; [2025-03-16 17:50:29,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L77: havoc main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1;havoc main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1; [2025-03-16 17:50:29,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L29: havoc main_~main____CPAchecker_TMP_0~0#1; [2025-03-16 17:50:29,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L302: havoc main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1;havoc main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1; [2025-03-16 17:50:29,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L229: havoc main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1;havoc main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1;havoc main_~main____CPAchecker_TMP_6~0#1; [2025-03-16 17:50:29,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: havoc main_~main____CPAchecker_TMP_5~0#1;havoc main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1;havoc main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1;havoc main_~main____CPAchecker_TMP_4~0#1; [2025-03-16 17:50:29,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc main_~main____CPAchecker_TMP_2~0#1;havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1; [2025-03-16 17:50:29,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L147: havoc main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1;havoc main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1; [2025-03-16 17:50:29,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc main_~main____CPAchecker_TMP_3~0#1; [2025-03-16 17:50:29,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L321: havoc main_~main____CPAchecker_TMP_0~1#1; [2025-03-16 17:50:29,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: havoc main_~__tmp_20~0#1, main_~__VERIFIER_assert__cond~19#1;havoc main_~__tmp_19~0#1, main_~__VERIFIER_assert__cond~18#1; [2025-03-16 17:50:29,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L338: havoc main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1;havoc main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1; [2025-03-16 17:50:29,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L282: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1;havoc main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1; [2025-03-16 17:50:29,336 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-03-16 17:50:29,336 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:50:29,344 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:50:29,344 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:50:29,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:50:29 BoogieIcfgContainer [2025-03-16 17:50:29,344 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:50:29,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:50:29,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:50:29,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:50:29,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:50:28" (1/3) ... [2025-03-16 17:50:29,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683a30cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:50:29, skipping insertion in model container [2025-03-16 17:50:29,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28" (2/3) ... [2025-03-16 17:50:29,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683a30cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:50:29, skipping insertion in model container [2025-03-16 17:50:29,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:50:29" (3/3) ... [2025-03-16 17:50:29,351 INFO L128 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2025-03-16 17:50:29,362 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:50:29,363 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG apache-get-tag.i.v+lhb-reducer.c that has 1 procedures, 74 locations, 1 initial locations, 0 loop locations, and 18 error locations. [2025-03-16 17:50:29,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:50:29,419 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;@6f7d4bc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:50:29,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-16 17:50:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 73 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 17:50:29,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:29,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:29,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:29,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:29,431 INFO L85 PathProgramCache]: Analyzing trace with hash 768738778, now seen corresponding path program 1 times [2025-03-16 17:50:29,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:29,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244173070] [2025-03-16 17:50:29,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:29,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:29,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 17:50:29,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 17:50:29,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:29,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:29,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:29,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244173070] [2025-03-16 17:50:29,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244173070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:29,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:29,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:50:29,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835165976] [2025-03-16 17:50:29,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:29,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:50:29,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:29,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:50:29,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:50:29,689 INFO L87 Difference]: Start difference. First operand has 74 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 73 states have internal predecessors, (103), 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-03-16 17:50:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:29,773 INFO L93 Difference]: Finished difference Result 80 states and 108 transitions. [2025-03-16 17:50:29,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:50:29,775 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-03-16 17:50:29,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:29,779 INFO L225 Difference]: With dead ends: 80 [2025-03-16 17:50:29,779 INFO L226 Difference]: Without dead ends: 70 [2025-03-16 17:50:29,781 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-03-16 17:50:29,783 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 9 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:29,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 191 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:29,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-16 17:50:29,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-03-16 17:50:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.411764705882353) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2025-03-16 17:50:29,802 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 7 [2025-03-16 17:50:29,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:29,803 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2025-03-16 17:50:29,803 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-03-16 17:50:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2025-03-16 17:50:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 17:50:29,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:29,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:29,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:50:29,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:29,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:29,804 INFO L85 PathProgramCache]: Analyzing trace with hash 766830125, now seen corresponding path program 1 times [2025-03-16 17:50:29,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:29,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870286571] [2025-03-16 17:50:29,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:29,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:29,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 17:50:29,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 17:50:29,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:29,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:29,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:29,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870286571] [2025-03-16 17:50:29,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870286571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:29,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:29,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:50:29,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21139753] [2025-03-16 17:50:29,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:29,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:50:29,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:29,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:50:29,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:50:29,899 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. 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-03-16 17:50:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:29,942 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2025-03-16 17:50:29,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:50:29,943 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-03-16 17:50:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:29,943 INFO L225 Difference]: With dead ends: 70 [2025-03-16 17:50:29,943 INFO L226 Difference]: Without dead ends: 68 [2025-03-16 17:50:29,943 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-03-16 17:50:29,944 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:29,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 161 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:50:29,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-16 17:50:29,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2025-03-16 17:50:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2025-03-16 17:50:29,947 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 7 [2025-03-16 17:50:29,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:29,947 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2025-03-16 17:50:29,947 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-03-16 17:50:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2025-03-16 17:50:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 17:50:29,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:29,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:29,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:50:29,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:29,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:29,948 INFO L85 PathProgramCache]: Analyzing trace with hash 731981360, now seen corresponding path program 1 times [2025-03-16 17:50:29,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:29,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065610592] [2025-03-16 17:50:29,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:29,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:29,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 17:50:29,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 17:50:29,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:29,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:30,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065610592] [2025-03-16 17:50:30,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065610592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:30,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:30,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:50:30,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466916089] [2025-03-16 17:50:30,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:30,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:50:30,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:30,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:50:30,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:50:30,023 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:30,100 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2025-03-16 17:50:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:30,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2025-03-16 17:50:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:30,101 INFO L225 Difference]: With dead ends: 68 [2025-03-16 17:50:30,101 INFO L226 Difference]: Without dead ends: 66 [2025-03-16 17:50:30,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:30,102 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:30,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 125 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-16 17:50:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2025-03-16 17:50:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2025-03-16 17:50:30,104 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 10 [2025-03-16 17:50:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:30,104 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2025-03-16 17:50:30,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2025-03-16 17:50:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 17:50:30,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:30,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:30,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:50:30,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:30,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:30,105 INFO L85 PathProgramCache]: Analyzing trace with hash -292889979, now seen corresponding path program 1 times [2025-03-16 17:50:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:30,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284030414] [2025-03-16 17:50:30,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:30,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:30,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 17:50:30,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 17:50:30,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:30,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:30,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:30,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284030414] [2025-03-16 17:50:30,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284030414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:30,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:30,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:50:30,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130690283] [2025-03-16 17:50:30,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:30,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:50:30,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:30,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:50:30,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:50:30,155 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:30,217 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2025-03-16 17:50:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:30,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2025-03-16 17:50:30,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:30,218 INFO L225 Difference]: With dead ends: 66 [2025-03-16 17:50:30,218 INFO L226 Difference]: Without dead ends: 64 [2025-03-16 17:50:30,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:30,218 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:30,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 119 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:50:30,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-16 17:50:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-03-16 17:50:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2025-03-16 17:50:30,221 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 10 [2025-03-16 17:50:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:30,221 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2025-03-16 17:50:30,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2025-03-16 17:50:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 17:50:30,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:30,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:30,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:50:30,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:30,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:30,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1216585031, now seen corresponding path program 1 times [2025-03-16 17:50:30,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:30,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034628907] [2025-03-16 17:50:30,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:30,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:30,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 17:50:30,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 17:50:30,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:30,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:30,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:30,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034628907] [2025-03-16 17:50:30,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034628907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:30,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:30,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:50:30,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495078851] [2025-03-16 17:50:30,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:30,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:50:30,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:30,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:50:30,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:50:30,283 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:30,321 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2025-03-16 17:50:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:50:30,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-03-16 17:50:30,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:30,322 INFO L225 Difference]: With dead ends: 64 [2025-03-16 17:50:30,322 INFO L226 Difference]: Without dead ends: 60 [2025-03-16 17:50:30,322 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-03-16 17:50:30,323 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 9 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:30,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 137 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:50:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-16 17:50:30,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-03-16 17:50:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2025-03-16 17:50:30,326 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 11 [2025-03-16 17:50:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:30,326 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2025-03-16 17:50:30,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2025-03-16 17:50:30,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 17:50:30,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:30,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:30,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 17:50:30,328 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:30,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:30,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1217572098, now seen corresponding path program 1 times [2025-03-16 17:50:30,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:30,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430711948] [2025-03-16 17:50:30,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:30,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:30,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 17:50:30,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 17:50:30,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:30,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:30,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:30,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430711948] [2025-03-16 17:50:30,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430711948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:30,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:30,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:50:30,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182036975] [2025-03-16 17:50:30,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:30,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:50:30,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:30,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:50:30,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:50:30,385 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:30,449 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2025-03-16 17:50:30,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:30,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2025-03-16 17:50:30,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:30,451 INFO L225 Difference]: With dead ends: 60 [2025-03-16 17:50:30,451 INFO L226 Difference]: Without dead ends: 58 [2025-03-16 17:50:30,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:30,451 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 40 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:30,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 105 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-16 17:50:30,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-03-16 17:50:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2025-03-16 17:50:30,457 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 11 [2025-03-16 17:50:30,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:30,457 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2025-03-16 17:50:30,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2025-03-16 17:50:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 17:50:30,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:30,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:30,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 17:50:30,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:30,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1217557203, now seen corresponding path program 1 times [2025-03-16 17:50:30,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:30,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834873529] [2025-03-16 17:50:30,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:30,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:30,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 17:50:30,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 17:50:30,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:30,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:30,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:30,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834873529] [2025-03-16 17:50:30,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834873529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:30,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:30,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:50:30,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91408423] [2025-03-16 17:50:30,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:30,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:50:30,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:30,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:50:30,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:50:30,531 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:30,592 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2025-03-16 17:50:30,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:30,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2025-03-16 17:50:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:30,592 INFO L225 Difference]: With dead ends: 58 [2025-03-16 17:50:30,593 INFO L226 Difference]: Without dead ends: 56 [2025-03-16 17:50:30,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:30,593 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:30,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 99 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:30,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-16 17:50:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-16 17:50:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2025-03-16 17:50:30,599 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 11 [2025-03-16 17:50:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:30,599 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2025-03-16 17:50:30,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2025-03-16 17:50:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 17:50:30,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:30,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:30,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 17:50:30,601 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:30,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:30,601 INFO L85 PathProgramCache]: Analyzing trace with hash -489655482, now seen corresponding path program 1 times [2025-03-16 17:50:30,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:30,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487296448] [2025-03-16 17:50:30,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:30,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:30,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 17:50:30,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 17:50:30,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:30,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:30,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:30,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487296448] [2025-03-16 17:50:30,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487296448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:30,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:30,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:50:30,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137852775] [2025-03-16 17:50:30,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:30,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:50:30,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:30,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:50:30,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:50:30,637 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:30,666 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2025-03-16 17:50:30,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:50:30,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-03-16 17:50:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:30,667 INFO L225 Difference]: With dead ends: 56 [2025-03-16 17:50:30,667 INFO L226 Difference]: Without dead ends: 52 [2025-03-16 17:50:30,667 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-03-16 17:50:30,668 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 9 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:30,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 117 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:50:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-16 17:50:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-03-16 17:50:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.35) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-03-16 17:50:30,669 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2025-03-16 17:50:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:30,669 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-03-16 17:50:30,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-03-16 17:50:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 17:50:30,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:30,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:30,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 17:50:30,670 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:30,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:30,670 INFO L85 PathProgramCache]: Analyzing trace with hash -909971213, now seen corresponding path program 1 times [2025-03-16 17:50:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:30,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626461764] [2025-03-16 17:50:30,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:30,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 17:50:30,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 17:50:30,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:30,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:30,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:30,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626461764] [2025-03-16 17:50:30,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626461764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:30,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:30,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:50:30,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909976100] [2025-03-16 17:50:30,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:30,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:50:30,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:30,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:50:30,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:30,763 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:30,831 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2025-03-16 17:50:30,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:50:30,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2025-03-16 17:50:30,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:30,833 INFO L225 Difference]: With dead ends: 84 [2025-03-16 17:50:30,833 INFO L226 Difference]: Without dead ends: 82 [2025-03-16 17:50:30,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:30,833 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:30,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 138 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-16 17:50:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2025-03-16 17:50:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-03-16 17:50:30,836 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 12 [2025-03-16 17:50:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:30,836 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-03-16 17:50:30,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-03-16 17:50:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 17:50:30,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:30,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:30,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 17:50:30,837 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:30,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:30,838 INFO L85 PathProgramCache]: Analyzing trace with hash -910432973, now seen corresponding path program 1 times [2025-03-16 17:50:30,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:30,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618029010] [2025-03-16 17:50:30,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:30,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:30,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 17:50:30,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 17:50:30,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:30,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:30,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:30,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618029010] [2025-03-16 17:50:30,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618029010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:30,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:30,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:50:30,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729918863] [2025-03-16 17:50:30,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:30,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:50:30,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:30,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:50:30,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:30,921 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:31,003 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-03-16 17:50:31,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:50:31,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2025-03-16 17:50:31,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:31,004 INFO L225 Difference]: With dead ends: 82 [2025-03-16 17:50:31,004 INFO L226 Difference]: Without dead ends: 80 [2025-03-16 17:50:31,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:31,004 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:31,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 113 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-16 17:50:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 57. [2025-03-16 17:50:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2025-03-16 17:50:31,006 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 12 [2025-03-16 17:50:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:31,006 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2025-03-16 17:50:31,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2025-03-16 17:50:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 17:50:31,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:31,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:31,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 17:50:31,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:31,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:31,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2072520332, now seen corresponding path program 1 times [2025-03-16 17:50:31,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:31,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258616700] [2025-03-16 17:50:31,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:31,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:31,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 17:50:31,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 17:50:31,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:31,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:31,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:31,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258616700] [2025-03-16 17:50:31,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258616700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:31,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:31,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:50:31,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631693327] [2025-03-16 17:50:31,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:31,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:50:31,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:31,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:50:31,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:50:31,043 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:31,108 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2025-03-16 17:50:31,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:31,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2025-03-16 17:50:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:31,109 INFO L225 Difference]: With dead ends: 58 [2025-03-16 17:50:31,109 INFO L226 Difference]: Without dead ends: 56 [2025-03-16 17:50:31,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:31,110 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:31,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 85 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-16 17:50:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2025-03-16 17:50:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-03-16 17:50:31,112 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 12 [2025-03-16 17:50:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:31,113 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-03-16 17:50:31,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-03-16 17:50:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 17:50:31,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:31,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:31,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 17:50:31,113 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:31,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2073136046, now seen corresponding path program 1 times [2025-03-16 17:50:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:31,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189911316] [2025-03-16 17:50:31,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:31,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:31,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 17:50:31,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 17:50:31,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:31,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:31,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:31,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189911316] [2025-03-16 17:50:31,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189911316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:31,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:31,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:50:31,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341515471] [2025-03-16 17:50:31,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:31,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:50:31,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:31,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:50:31,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:50:31,165 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:31,215 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-03-16 17:50:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:31,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2025-03-16 17:50:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:31,216 INFO L225 Difference]: With dead ends: 56 [2025-03-16 17:50:31,216 INFO L226 Difference]: Without dead ends: 54 [2025-03-16 17:50:31,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:31,217 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:31,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 79 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:50:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-16 17:50:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2025-03-16 17:50:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-03-16 17:50:31,219 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 12 [2025-03-16 17:50:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:31,219 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-03-16 17:50:31,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-03-16 17:50:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 17:50:31,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:31,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:31,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 17:50:31,219 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:31,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:31,221 INFO L85 PathProgramCache]: Analyzing trace with hash -176324190, now seen corresponding path program 1 times [2025-03-16 17:50:31,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:31,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883467870] [2025-03-16 17:50:31,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:31,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:31,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 17:50:31,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 17:50:31,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:31,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:31,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:31,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883467870] [2025-03-16 17:50:31,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883467870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:31,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:31,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:50:31,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191068910] [2025-03-16 17:50:31,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:31,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:50:31,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:31,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:50:31,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:50:31,268 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:31,319 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2025-03-16 17:50:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:31,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2025-03-16 17:50:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:31,319 INFO L225 Difference]: With dead ends: 54 [2025-03-16 17:50:31,319 INFO L226 Difference]: Without dead ends: 52 [2025-03-16 17:50:31,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:31,320 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:31,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 73 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:50:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-16 17:50:31,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-03-16 17:50:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-03-16 17:50:31,322 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2025-03-16 17:50:31,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:31,322 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-03-16 17:50:31,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-03-16 17:50:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 17:50:31,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:31,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:31,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 17:50:31,325 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:31,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:31,326 INFO L85 PathProgramCache]: Analyzing trace with hash -176378832, now seen corresponding path program 1 times [2025-03-16 17:50:31,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:31,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848120425] [2025-03-16 17:50:31,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:31,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:31,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 17:50:31,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 17:50:31,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:31,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:31,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:31,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848120425] [2025-03-16 17:50:31,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848120425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:31,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:31,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:50:31,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456440285] [2025-03-16 17:50:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:31,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:50:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:31,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:50:31,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:31,450 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:31,514 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2025-03-16 17:50:31,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:50:31,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2025-03-16 17:50:31,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:31,515 INFO L225 Difference]: With dead ends: 68 [2025-03-16 17:50:31,515 INFO L226 Difference]: Without dead ends: 66 [2025-03-16 17:50:31,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:31,515 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 25 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:31,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 92 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-16 17:50:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2025-03-16 17:50:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-03-16 17:50:31,517 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2025-03-16 17:50:31,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:31,517 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-03-16 17:50:31,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-03-16 17:50:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 17:50:31,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:31,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:31,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 17:50:31,518 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:31,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:31,518 INFO L85 PathProgramCache]: Analyzing trace with hash -157292698, now seen corresponding path program 1 times [2025-03-16 17:50:31,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:31,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134817373] [2025-03-16 17:50:31,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:31,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:31,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 17:50:31,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 17:50:31,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:31,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:31,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:31,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134817373] [2025-03-16 17:50:31,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134817373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:31,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:31,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:50:31,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438655707] [2025-03-16 17:50:31,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:31,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:50:31,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:31,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:50:31,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:31,617 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:31,669 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2025-03-16 17:50:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:50:31,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2025-03-16 17:50:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:31,670 INFO L225 Difference]: With dead ends: 69 [2025-03-16 17:50:31,670 INFO L226 Difference]: Without dead ends: 65 [2025-03-16 17:50:31,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:31,670 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 25 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:31,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 92 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:50:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-16 17:50:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2025-03-16 17:50:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2025-03-16 17:50:31,673 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 13 [2025-03-16 17:50:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:31,673 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2025-03-16 17:50:31,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2025-03-16 17:50:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 17:50:31,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:31,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:31,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 17:50:31,674 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:31,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:31,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1171083246, now seen corresponding path program 1 times [2025-03-16 17:50:31,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:31,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168753766] [2025-03-16 17:50:31,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:31,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:31,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 17:50:31,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 17:50:31,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:31,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:31,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:31,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168753766] [2025-03-16 17:50:31,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168753766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:31,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:31,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:50:31,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876809118] [2025-03-16 17:50:31,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:31,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:50:31,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:31,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:50:31,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:31,753 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:31,814 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2025-03-16 17:50:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:50:31,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2025-03-16 17:50:31,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:31,815 INFO L225 Difference]: With dead ends: 65 [2025-03-16 17:50:31,815 INFO L226 Difference]: Without dead ends: 63 [2025-03-16 17:50:31,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:31,815 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:31,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 116 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:50:31,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-16 17:50:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-16 17:50:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2025-03-16 17:50:31,817 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 14 [2025-03-16 17:50:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:31,817 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2025-03-16 17:50:31,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2025-03-16 17:50:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 17:50:31,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:31,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:31,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 17:50:31,822 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:31,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:31,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1996345800, now seen corresponding path program 1 times [2025-03-16 17:50:31,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:31,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809591145] [2025-03-16 17:50:31,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:31,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:31,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 17:50:31,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 17:50:31,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:31,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:31,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:31,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809591145] [2025-03-16 17:50:31,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809591145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:31,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:31,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:50:31,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205980913] [2025-03-16 17:50:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:31,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:50:31,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:31,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:50:31,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:50:31,881 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:31,903 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2025-03-16 17:50:31,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:50:31,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2025-03-16 17:50:31,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:31,903 INFO L225 Difference]: With dead ends: 61 [2025-03-16 17:50:31,903 INFO L226 Difference]: Without dead ends: 59 [2025-03-16 17:50:31,904 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-03-16 17:50:31,904 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:31,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 69 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:50:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-16 17:50:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-16 17:50:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2025-03-16 17:50:31,906 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 15 [2025-03-16 17:50:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:31,906 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2025-03-16 17:50:31,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2025-03-16 17:50:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 17:50:31,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:31,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:31,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 17:50:31,906 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:31,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1757178385, now seen corresponding path program 1 times [2025-03-16 17:50:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:31,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549734164] [2025-03-16 17:50:31,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:31,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 17:50:31,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 17:50:31,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:31,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:31,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:31,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549734164] [2025-03-16 17:50:31,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549734164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:31,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:31,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:50:31,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135295493] [2025-03-16 17:50:31,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:31,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:50:31,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:31,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:50:31,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:50:31,946 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:31,970 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2025-03-16 17:50:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:50:31,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2025-03-16 17:50:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:31,971 INFO L225 Difference]: With dead ends: 59 [2025-03-16 17:50:31,971 INFO L226 Difference]: Without dead ends: 55 [2025-03-16 17:50:31,971 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-03-16 17:50:31,972 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:31,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 87 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:50:31,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-16 17:50:31,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-16 17:50:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2025-03-16 17:50:31,973 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 16 [2025-03-16 17:50:31,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:31,974 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2025-03-16 17:50:31,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,974 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2025-03-16 17:50:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 17:50:31,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:31,974 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:31,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 17:50:31,974 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:31,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:31,975 INFO L85 PathProgramCache]: Analyzing trace with hash 219428002, now seen corresponding path program 1 times [2025-03-16 17:50:31,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:31,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610397027] [2025-03-16 17:50:31,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:31,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:31,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 17:50:31,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 17:50:31,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:31,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:32,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:32,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:32,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610397027] [2025-03-16 17:50:32,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610397027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:50:32,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989934295] [2025-03-16 17:50:32,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:32,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:50:32,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:50:32,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:50:32,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:50:32,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 17:50:32,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 17:50:32,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:32,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:32,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 17:50:32,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:50:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:32,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:50:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:50:32,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989934295] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:50:32,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:50:32,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2025-03-16 17:50:32,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000650582] [2025-03-16 17:50:32,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:50:32,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 17:50:32,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:32,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 17:50:32,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 17:50:32,384 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:32,542 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2025-03-16 17:50:32,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 17:50:32,543 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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 17 [2025-03-16 17:50:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:32,543 INFO L225 Difference]: With dead ends: 82 [2025-03-16 17:50:32,543 INFO L226 Difference]: Without dead ends: 80 [2025-03-16 17:50:32,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2025-03-16 17:50:32,544 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 218 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:32,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 107 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-16 17:50:32,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 51. [2025-03-16 17:50:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-03-16 17:50:32,547 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 17 [2025-03-16 17:50:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:32,547 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-03-16 17:50:32,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-03-16 17:50:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 17:50:32,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:32,547 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:32,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 17:50:32,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:50:32,748 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:32,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash 218966242, now seen corresponding path program 1 times [2025-03-16 17:50:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:32,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349206116] [2025-03-16 17:50:32,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:32,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 17:50:32,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 17:50:32,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:32,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:32,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:32,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349206116] [2025-03-16 17:50:32,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349206116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:50:32,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825489210] [2025-03-16 17:50:32,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:32,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:50:32,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:50:32,823 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:50:32,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 17:50:32,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 17:50:32,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 17:50:32,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:32,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:32,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 17:50:32,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:50:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:32,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:50:33,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:50:33,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825489210] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:50:33,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:50:33,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2025-03-16 17:50:33,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020016848] [2025-03-16 17:50:33,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:50:33,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 17:50:33,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:33,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 17:50:33,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 17:50:33,057 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:33,187 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2025-03-16 17:50:33,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 17:50:33,187 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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 17 [2025-03-16 17:50:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:33,188 INFO L225 Difference]: With dead ends: 78 [2025-03-16 17:50:33,188 INFO L226 Difference]: Without dead ends: 76 [2025-03-16 17:50:33,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2025-03-16 17:50:33,188 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 133 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:33,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 89 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-16 17:50:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 44. [2025-03-16 17:50:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-03-16 17:50:33,190 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 17 [2025-03-16 17:50:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:33,190 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-03-16 17:50:33,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-03-16 17:50:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 17:50:33,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:33,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:33,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 17:50:33,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-16 17:50:33,394 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:33,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:33,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1379283020, now seen corresponding path program 1 times [2025-03-16 17:50:33,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:33,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594051994] [2025-03-16 17:50:33,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:33,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:33,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 17:50:33,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 17:50:33,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:33,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:33,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:33,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594051994] [2025-03-16 17:50:33,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594051994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:33,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:33,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:50:33,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888341506] [2025-03-16 17:50:33,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:33,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:50:33,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:33,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:50:33,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:33,451 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:33,499 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-03-16 17:50:33,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:33,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2025-03-16 17:50:33,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:33,500 INFO L225 Difference]: With dead ends: 44 [2025-03-16 17:50:33,500 INFO L226 Difference]: Without dead ends: 42 [2025-03-16 17:50:33,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:50:33,500 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 67 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:33,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 31 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:50:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-16 17:50:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2025-03-16 17:50:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-03-16 17:50:33,501 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 17 [2025-03-16 17:50:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:33,502 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-03-16 17:50:33,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-03-16 17:50:33,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:50:33,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:33,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:33,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 17:50:33,502 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:33,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:33,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1085751602, now seen corresponding path program 1 times [2025-03-16 17:50:33,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:33,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317557777] [2025-03-16 17:50:33,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:33,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:33,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:50:33,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:50:33,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:33,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:33,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:33,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317557777] [2025-03-16 17:50:33,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317557777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:33,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:33,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 17:50:33,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725010055] [2025-03-16 17:50:33,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:33,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:50:33,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:33,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:50:33,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:33,562 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:33,604 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2025-03-16 17:50:33,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:33,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2025-03-16 17:50:33,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:33,604 INFO L225 Difference]: With dead ends: 39 [2025-03-16 17:50:33,604 INFO L226 Difference]: Without dead ends: 37 [2025-03-16 17:50:33,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:50:33,605 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 60 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:33,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 29 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:50:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-16 17:50:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2025-03-16 17:50:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-16 17:50:33,606 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 18 [2025-03-16 17:50:33,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:33,606 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-16 17:50:33,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-16 17:50:33,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:50:33,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:33,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:33,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 17:50:33,607 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-16 17:50:33,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:33,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1104837736, now seen corresponding path program 1 times [2025-03-16 17:50:33,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:33,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904926691] [2025-03-16 17:50:33,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:33,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:33,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:50:33,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:50:33,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:33,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:33,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:33,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904926691] [2025-03-16 17:50:33,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904926691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:33,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:33,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 17:50:33,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539345249] [2025-03-16 17:50:33,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:33,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:50:33,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:33,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:50:33,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:33,678 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:33,710 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2025-03-16 17:50:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:33,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2025-03-16 17:50:33,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:33,711 INFO L225 Difference]: With dead ends: 34 [2025-03-16 17:50:33,711 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 17:50:33,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:33,712 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 78 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:33,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 19 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:50:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 17:50:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 17:50:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 17:50:33,712 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2025-03-16 17:50:33,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:33,713 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 17:50:33,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 17:50:33,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 17:50:33,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2025-03-16 17:50:33,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2025-03-16 17:50:33,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2025-03-16 17:50:33,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2025-03-16 17:50:33,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2025-03-16 17:50:33,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2025-03-16 17:50:33,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2025-03-16 17:50:33,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2025-03-16 17:50:33,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2025-03-16 17:50:33,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2025-03-16 17:50:33,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2025-03-16 17:50:33,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2025-03-16 17:50:33,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2025-03-16 17:50:33,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2025-03-16 17:50:33,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2025-03-16 17:50:33,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2025-03-16 17:50:33,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2025-03-16 17:50:33,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2025-03-16 17:50:33,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 17:50:33,718 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:33,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 17:50:33,723 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 17:50:33,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 05:50:33 BoogieIcfgContainer [2025-03-16 17:50:33,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 17:50:33,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 17:50:33,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 17:50:33,729 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 17:50:33,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:50:29" (3/4) ... [2025-03-16 17:50:33,732 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 17:50:33,742 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-16 17:50:33,743 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 17:50:33,743 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 17:50:33,743 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 17:50:33,812 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 17:50:33,813 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 17:50:33,813 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 17:50:33,814 INFO L158 Benchmark]: Toolchain (without parser) took 5088.62ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 113.1MB in the beginning and 218.9MB in the end (delta: -105.8MB). Peak memory consumption was 145.0MB. Max. memory is 16.1GB. [2025-03-16 17:50:33,814 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:50:33,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.23ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 99.3MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:50:33,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.25ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:50:33,815 INFO L158 Benchmark]: Boogie Preprocessor took 42.81ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:50:33,815 INFO L158 Benchmark]: IcfgBuilder took 343.53ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 76.3MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:50:33,816 INFO L158 Benchmark]: TraceAbstraction took 4382.88ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 75.8MB in the beginning and 227.2MB in the end (delta: -151.4MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. [2025-03-16 17:50:33,816 INFO L158 Benchmark]: Witness Printer took 83.56ms. Allocated memory is still 394.3MB. Free memory was 227.2MB in the beginning and 218.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:50:33,817 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.28ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.23ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 99.3MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.25ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.81ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 343.53ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 76.3MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4382.88ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 75.8MB in the beginning and 227.2MB in the end (delta: -151.4MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. * Witness Printer took 83.56ms. Allocated memory is still 394.3MB. Free memory was 227.2MB in the beginning and 218.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. 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: 52]: 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: 72]: 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: 84]: 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: 114]: 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: 126]: 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: 142]: 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: 154]: 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: 176]: 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: 188]: 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: 224]: 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: 236]: 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: 278]: 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: 297]: 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: 309]: 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: 333]: 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: 345]: 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: 366]: 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: 378]: 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, 74 locations, 103 edges, 18 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1012 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1012 mSDsluCounter, 2273 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1529 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1830 IncrementalHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 744 mSDtfsCounter, 1830 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=0, InterpolantAutomatonStates: 132, 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, 23 MinimizatonAttempts, 154 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 338 ConstructedInterpolants, 0 QuantifiedInterpolants, 1403 SizeOfPredicates, 6 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 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 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-16 17:50:33,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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