./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c74f92ba3d978b3a2efb098ebc8eb373bc42abebaabf8c6efaf148fbe05036e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:48:43,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:48:43,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:48:43,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:48:43,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:48:43,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:48:43,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:48:43,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:48:43,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:48:43,932 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:48:43,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:48:43,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:48:43,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:48:43,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:48:43,936 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:48:43,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:48:43,937 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:48:43,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:48:43,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:48:43,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:48:43,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:48:43,938 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:48:43,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:48:43,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:48:43,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:48:43,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:48:43,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:48:43,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:48:43,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:48:43,938 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c74f92ba3d978b3a2efb098ebc8eb373bc42abebaabf8c6efaf148fbe05036e0 [2025-01-09 04:48:44,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:48:44,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:48:44,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:48:44,169 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:48:44,169 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:48:44,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-01-09 04:48:45,664 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74d56ef12/7cabe3a4af164a8b887cb8e8750c061c/FLAG9e1fce57b [2025-01-09 04:48:46,086 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:48:46,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-01-09 04:48:46,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74d56ef12/7cabe3a4af164a8b887cb8e8750c061c/FLAG9e1fce57b [2025-01-09 04:48:46,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74d56ef12/7cabe3a4af164a8b887cb8e8750c061c [2025-01-09 04:48:46,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:48:46,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:48:46,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:48:46,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:48:46,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:48:46,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:46,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ecc5b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46, skipping insertion in model container [2025-01-09 04:48:46,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:46,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:48:46,545 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18857,18870] [2025-01-09 04:48:46,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25957,25970] [2025-01-09 04:48:46,589 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29482,29495] [2025-01-09 04:48:46,597 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32880,32893] [2025-01-09 04:48:46,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36938,36951] [2025-01-09 04:48:46,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40412,40425] [2025-01-09 04:48:46,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43977,43990] [2025-01-09 04:48:46,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47412,47425] [2025-01-09 04:48:46,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[51091,51104] [2025-01-09 04:48:46,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54693,54706] [2025-01-09 04:48:46,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58222,58235] [2025-01-09 04:48:46,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:48:46,708 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:48:46,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18857,18870] [2025-01-09 04:48:46,777 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25957,25970] [2025-01-09 04:48:46,782 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29482,29495] [2025-01-09 04:48:46,787 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32880,32893] [2025-01-09 04:48:46,792 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36938,36951] [2025-01-09 04:48:46,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40412,40425] [2025-01-09 04:48:46,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43977,43990] [2025-01-09 04:48:46,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47412,47425] [2025-01-09 04:48:46,819 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[51091,51104] [2025-01-09 04:48:46,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54693,54706] [2025-01-09 04:48:46,830 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58222,58235] [2025-01-09 04:48:46,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:48:46,861 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:48:46,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46 WrapperNode [2025-01-09 04:48:46,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:48:46,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:48:46,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:48:46,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:48:46,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:46,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:46,950 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2971 [2025-01-09 04:48:46,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:48:46,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:48:46,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:48:46,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:48:46,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:46,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:46,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:47,002 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:48:47,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:47,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:47,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:47,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:47,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:47,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:47,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:47,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:48:47,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:48:47,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:48:47,077 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:48:47,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46" (1/1) ... [2025-01-09 04:48:47,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:48:47,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:48:47,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:48:47,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:48:47,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:48:47,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:48:47,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:48:47,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:48:47,353 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:48:47,358 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:48:49,180 INFO L? ?]: Removed 576 outVars from TransFormulas that were not future-live. [2025-01-09 04:48:49,180 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:48:49,195 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:48:49,195 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:48:49,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:48:49 BoogieIcfgContainer [2025-01-09 04:48:49,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:48:49,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:48:49,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:48:49,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:48:49,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:48:46" (1/3) ... [2025-01-09 04:48:49,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a74164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:48:49, skipping insertion in model container [2025-01-09 04:48:49,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:46" (2/3) ... [2025-01-09 04:48:49,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a74164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:48:49, skipping insertion in model container [2025-01-09 04:48:49,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:48:49" (3/3) ... [2025-01-09 04:48:49,201 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-01-09 04:48:49,210 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:48:49,212 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c that has 1 procedures, 570 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-01-09 04:48:49,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:48:49,292 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;@cdbdf27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:48:49,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-09 04:48:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 570 states, 558 states have (on average 1.7831541218637992) internal successors, (995), 569 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 04:48:49,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:49,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:48:49,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:48:49,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:49,309 INFO L85 PathProgramCache]: Analyzing trace with hash 646480323, now seen corresponding path program 1 times [2025-01-09 04:48:49,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:49,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286673297] [2025-01-09 04:48:49,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:49,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:49,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 04:48:49,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 04:48:49,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:49,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:49,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:49,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286673297] [2025-01-09 04:48:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286673297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:49,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:48:49,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380268744] [2025-01-09 04:48:49,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:49,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:48:49,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:49,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:48:49,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:48:49,760 INFO L87 Difference]: Start difference. First operand has 570 states, 558 states have (on average 1.7831541218637992) internal successors, (995), 569 states have internal predecessors, (995), 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 5 states, 5 states have (on average 12.0) internal successors, (60), 4 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-01-09 04:48:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:50,269 INFO L93 Difference]: Finished difference Result 785 states and 1334 transitions. [2025-01-09 04:48:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:48:50,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 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) Word has length 60 [2025-01-09 04:48:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:50,282 INFO L225 Difference]: With dead ends: 785 [2025-01-09 04:48:50,282 INFO L226 Difference]: Without dead ends: 503 [2025-01-09 04:48:50,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:48:50,289 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 2434 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:50,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2434 Valid, 551 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:48:50,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-01-09 04:48:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-01-09 04:48:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 492 states have (on average 1.274390243902439) internal successors, (627), 502 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 627 transitions. [2025-01-09 04:48:50,351 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 627 transitions. Word has length 60 [2025-01-09 04:48:50,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:50,351 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 627 transitions. [2025-01-09 04:48:50,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 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-01-09 04:48:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 627 transitions. [2025-01-09 04:48:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 04:48:50,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:50,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:48:50,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:48:50,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:48:50,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:50,355 INFO L85 PathProgramCache]: Analyzing trace with hash 221242932, now seen corresponding path program 1 times [2025-01-09 04:48:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:50,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462683999] [2025-01-09 04:48:50,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:50,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:50,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 04:48:50,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 04:48:50,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:50,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:50,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:50,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462683999] [2025-01-09 04:48:50,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462683999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:50,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:50,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:48:50,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597985017] [2025-01-09 04:48:50,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:50,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:48:50,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:50,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:48:50,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:48:50,576 INFO L87 Difference]: Start difference. First operand 503 states and 627 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 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-01-09 04:48:50,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:50,797 INFO L93 Difference]: Finished difference Result 637 states and 796 transitions. [2025-01-09 04:48:50,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:48:50,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 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) Word has length 60 [2025-01-09 04:48:50,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:50,800 INFO L225 Difference]: With dead ends: 637 [2025-01-09 04:48:50,801 INFO L226 Difference]: Without dead ends: 381 [2025-01-09 04:48:50,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:48:50,802 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1376 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:50,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 266 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:48:50,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-01-09 04:48:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2025-01-09 04:48:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 370 states have (on average 1.2864864864864864) internal successors, (476), 380 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 476 transitions. [2025-01-09 04:48:50,810 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 476 transitions. Word has length 60 [2025-01-09 04:48:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:50,810 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 476 transitions. [2025-01-09 04:48:50,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 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-01-09 04:48:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2025-01-09 04:48:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 04:48:50,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:50,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:48:50,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:48:50,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:48:50,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2147344789, now seen corresponding path program 1 times [2025-01-09 04:48:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:50,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040179869] [2025-01-09 04:48:50,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:50,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:50,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 04:48:50,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 04:48:50,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:50,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:50,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:50,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:50,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040179869] [2025-01-09 04:48:50,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040179869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:50,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:50,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:48:50,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489480130] [2025-01-09 04:48:50,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:50,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:48:50,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:50,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:48:50,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:48:50,998 INFO L87 Difference]: Start difference. First operand 381 states and 476 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 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-01-09 04:48:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:51,250 INFO L93 Difference]: Finished difference Result 713 states and 908 transitions. [2025-01-09 04:48:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:48:51,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 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) Word has length 60 [2025-01-09 04:48:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:51,252 INFO L225 Difference]: With dead ends: 713 [2025-01-09 04:48:51,252 INFO L226 Difference]: Without dead ends: 509 [2025-01-09 04:48:51,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:48:51,253 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 1673 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:51,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 371 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:48:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-01-09 04:48:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 450. [2025-01-09 04:48:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 439 states have (on average 1.3416856492027336) internal successors, (589), 449 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 589 transitions. [2025-01-09 04:48:51,263 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 589 transitions. Word has length 60 [2025-01-09 04:48:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:51,263 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 589 transitions. [2025-01-09 04:48:51,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 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-01-09 04:48:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 589 transitions. [2025-01-09 04:48:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 04:48:51,264 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:51,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:48:51,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:48:51,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:48:51,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:51,265 INFO L85 PathProgramCache]: Analyzing trace with hash 604643521, now seen corresponding path program 1 times [2025-01-09 04:48:51,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:51,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028004285] [2025-01-09 04:48:51,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:51,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:51,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 04:48:51,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 04:48:51,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:51,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:51,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028004285] [2025-01-09 04:48:51,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028004285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:51,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:51,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:48:51,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997913649] [2025-01-09 04:48:51,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:51,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:48:51,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:51,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:48:51,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:48:51,424 INFO L87 Difference]: Start difference. First operand 450 states and 589 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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-01-09 04:48:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:51,626 INFO L93 Difference]: Finished difference Result 606 states and 794 transitions. [2025-01-09 04:48:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:48:51,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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) Word has length 62 [2025-01-09 04:48:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:51,628 INFO L225 Difference]: With dead ends: 606 [2025-01-09 04:48:51,631 INFO L226 Difference]: Without dead ends: 357 [2025-01-09 04:48:51,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:48:51,633 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 912 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:51,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 209 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:48:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-09 04:48:51,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-01-09 04:48:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.346820809248555) internal successors, (466), 356 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 466 transitions. [2025-01-09 04:48:51,671 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 466 transitions. Word has length 62 [2025-01-09 04:48:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:51,671 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 466 transitions. [2025-01-09 04:48:51,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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-01-09 04:48:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 466 transitions. [2025-01-09 04:48:51,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:48:51,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:51,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:48:51,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:48:51,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:48:51,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:51,677 INFO L85 PathProgramCache]: Analyzing trace with hash -699288056, now seen corresponding path program 1 times [2025-01-09 04:48:51,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:51,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286530892] [2025-01-09 04:48:51,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:51,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:51,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:48:51,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:48:51,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:51,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:52,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:52,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286530892] [2025-01-09 04:48:52,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286530892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:52,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:52,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:48:52,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780765495] [2025-01-09 04:48:52,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:52,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:48:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:52,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:48:52,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:48:52,260 INFO L87 Difference]: Start difference. First operand 357 states and 466 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 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-01-09 04:48:52,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:52,749 INFO L93 Difference]: Finished difference Result 646 states and 856 transitions. [2025-01-09 04:48:52,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:48:52,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 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) Word has length 64 [2025-01-09 04:48:52,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:52,752 INFO L225 Difference]: With dead ends: 646 [2025-01-09 04:48:52,752 INFO L226 Difference]: Without dead ends: 502 [2025-01-09 04:48:52,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:48:52,753 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 1483 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:52,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1069 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:48:52,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-01-09 04:48:52,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 357. [2025-01-09 04:48:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3439306358381502) internal successors, (465), 356 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 465 transitions. [2025-01-09 04:48:52,763 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 465 transitions. Word has length 64 [2025-01-09 04:48:52,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:52,763 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 465 transitions. [2025-01-09 04:48:52,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 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-01-09 04:48:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 465 transitions. [2025-01-09 04:48:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:48:52,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:52,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:48:52,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:48:52,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:48:52,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1796013608, now seen corresponding path program 1 times [2025-01-09 04:48:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:52,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657844115] [2025-01-09 04:48:52,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:52,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:52,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:48:52,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:48:52,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:52,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:53,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:53,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657844115] [2025-01-09 04:48:53,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657844115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:53,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:53,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:48:53,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029890184] [2025-01-09 04:48:53,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:53,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:48:53,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:53,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:48:53,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:48:53,249 INFO L87 Difference]: Start difference. First operand 357 states and 465 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 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-01-09 04:48:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:53,847 INFO L93 Difference]: Finished difference Result 699 states and 938 transitions. [2025-01-09 04:48:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:48:53,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 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) Word has length 64 [2025-01-09 04:48:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:53,849 INFO L225 Difference]: With dead ends: 699 [2025-01-09 04:48:53,849 INFO L226 Difference]: Without dead ends: 579 [2025-01-09 04:48:53,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:48:53,851 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 1708 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:53,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 953 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:48:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-01-09 04:48:53,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 357. [2025-01-09 04:48:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3410404624277457) internal successors, (464), 356 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 464 transitions. [2025-01-09 04:48:53,863 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 464 transitions. Word has length 64 [2025-01-09 04:48:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:53,870 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 464 transitions. [2025-01-09 04:48:53,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 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-01-09 04:48:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 464 transitions. [2025-01-09 04:48:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:48:53,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:53,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:48:53,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:48:53,871 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:48:53,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1577721816, now seen corresponding path program 1 times [2025-01-09 04:48:53,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:53,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331757635] [2025-01-09 04:48:53,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:53,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:48:53,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:48:53,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:53,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:54,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:54,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331757635] [2025-01-09 04:48:54,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331757635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:54,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:54,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:48:54,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016594827] [2025-01-09 04:48:54,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:54,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:48:54,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:54,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:48:54,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:48:54,260 INFO L87 Difference]: Start difference. First operand 357 states and 464 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 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-01-09 04:48:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:54,764 INFO L93 Difference]: Finished difference Result 724 states and 946 transitions. [2025-01-09 04:48:54,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:48:54,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 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) Word has length 64 [2025-01-09 04:48:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:54,766 INFO L225 Difference]: With dead ends: 724 [2025-01-09 04:48:54,767 INFO L226 Difference]: Without dead ends: 531 [2025-01-09 04:48:54,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:48:54,767 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1320 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:54,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 642 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:48:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-01-09 04:48:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 357. [2025-01-09 04:48:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3381502890173411) internal successors, (463), 356 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 463 transitions. [2025-01-09 04:48:54,777 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 463 transitions. Word has length 64 [2025-01-09 04:48:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:54,778 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 463 transitions. [2025-01-09 04:48:54,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 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-01-09 04:48:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 463 transitions. [2025-01-09 04:48:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:48:54,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:54,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:48:54,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:48:54,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:48:54,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:54,780 INFO L85 PathProgramCache]: Analyzing trace with hash -295025225, now seen corresponding path program 1 times [2025-01-09 04:48:54,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:54,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798940609] [2025-01-09 04:48:54,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:54,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:54,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:48:54,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:48:54,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:54,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:55,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:55,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798940609] [2025-01-09 04:48:55,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798940609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:55,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:55,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:48:55,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047064501] [2025-01-09 04:48:55,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:55,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:48:55,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:55,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:48:55,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:48:55,042 INFO L87 Difference]: Start difference. First operand 357 states and 463 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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-01-09 04:48:55,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:55,417 INFO L93 Difference]: Finished difference Result 667 states and 887 transitions. [2025-01-09 04:48:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:48:55,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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) Word has length 65 [2025-01-09 04:48:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:55,421 INFO L225 Difference]: With dead ends: 667 [2025-01-09 04:48:55,421 INFO L226 Difference]: Without dead ends: 558 [2025-01-09 04:48:55,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:48:55,422 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1761 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:55,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 842 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:48:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-01-09 04:48:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 357. [2025-01-09 04:48:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3352601156069364) internal successors, (462), 356 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 462 transitions. [2025-01-09 04:48:55,430 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 462 transitions. Word has length 65 [2025-01-09 04:48:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:55,430 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 462 transitions. [2025-01-09 04:48:55,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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-01-09 04:48:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 462 transitions. [2025-01-09 04:48:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:48:55,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:55,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:48:55,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:48:55,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:48:55,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:55,458 INFO L85 PathProgramCache]: Analyzing trace with hash -168692467, now seen corresponding path program 1 times [2025-01-09 04:48:55,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:55,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469375660] [2025-01-09 04:48:55,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:55,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:55,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:48:55,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:48:55,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:55,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:55,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:55,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469375660] [2025-01-09 04:48:55,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469375660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:55,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:55,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:48:55,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926095679] [2025-01-09 04:48:55,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:55,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:48:55,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:55,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:48:55,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:48:55,678 INFO L87 Difference]: Start difference. First operand 357 states and 462 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-01-09 04:48:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:56,061 INFO L93 Difference]: Finished difference Result 598 states and 781 transitions. [2025-01-09 04:48:56,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:48:56,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) Word has length 66 [2025-01-09 04:48:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:56,064 INFO L225 Difference]: With dead ends: 598 [2025-01-09 04:48:56,064 INFO L226 Difference]: Without dead ends: 579 [2025-01-09 04:48:56,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:48:56,065 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 1115 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:56,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 1072 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:48:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-01-09 04:48:56,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 357. [2025-01-09 04:48:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.329479768786127) internal successors, (460), 356 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 460 transitions. [2025-01-09 04:48:56,074 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 460 transitions. Word has length 66 [2025-01-09 04:48:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:56,075 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 460 transitions. [2025-01-09 04:48:56,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-01-09 04:48:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 460 transitions. [2025-01-09 04:48:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:48:56,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:56,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:48:56,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:48:56,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:48:56,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:56,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1424145869, now seen corresponding path program 1 times [2025-01-09 04:48:56,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:56,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52747731] [2025-01-09 04:48:56,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:56,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:56,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:48:56,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:48:56,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:56,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:56,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52747731] [2025-01-09 04:48:56,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52747731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:56,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:56,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:48:56,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091174910] [2025-01-09 04:48:56,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:56,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:48:56,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:56,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:48:56,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:48:56,325 INFO L87 Difference]: Start difference. First operand 357 states and 460 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-01-09 04:48:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:56,702 INFO L93 Difference]: Finished difference Result 564 states and 728 transitions. [2025-01-09 04:48:56,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:48:56,703 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) Word has length 66 [2025-01-09 04:48:56,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:56,704 INFO L225 Difference]: With dead ends: 564 [2025-01-09 04:48:56,704 INFO L226 Difference]: Without dead ends: 558 [2025-01-09 04:48:56,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:48:56,705 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 1688 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:56,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 897 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:48:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-01-09 04:48:56,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 357. [2025-01-09 04:48:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.323699421965318) internal successors, (458), 356 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 458 transitions. [2025-01-09 04:48:56,712 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 458 transitions. Word has length 66 [2025-01-09 04:48:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:56,712 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 458 transitions. [2025-01-09 04:48:56,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-01-09 04:48:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 458 transitions. [2025-01-09 04:48:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:48:56,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:56,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:48:56,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:48:56,714 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:48:56,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:56,714 INFO L85 PathProgramCache]: Analyzing trace with hash -155488627, now seen corresponding path program 1 times [2025-01-09 04:48:56,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:56,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830764671] [2025-01-09 04:48:56,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:56,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:56,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:48:56,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:48:56,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:56,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:57,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:57,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830764671] [2025-01-09 04:48:57,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830764671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:57,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:57,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 04:48:57,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834606649] [2025-01-09 04:48:57,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:57,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:48:57,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:57,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:48:57,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:48:57,278 INFO L87 Difference]: Start difference. First operand 357 states and 458 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 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-01-09 04:48:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:57,839 INFO L93 Difference]: Finished difference Result 673 states and 904 transitions. [2025-01-09 04:48:57,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:48:57,840 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 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) Word has length 66 [2025-01-09 04:48:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:57,842 INFO L225 Difference]: With dead ends: 673 [2025-01-09 04:48:57,842 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 04:48:57,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2025-01-09 04:48:57,843 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 1631 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:57,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 1098 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:48:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 04:48:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 357. [2025-01-09 04:48:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3179190751445087) internal successors, (456), 356 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 456 transitions. [2025-01-09 04:48:57,851 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 456 transitions. Word has length 66 [2025-01-09 04:48:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:57,851 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 456 transitions. [2025-01-09 04:48:57,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 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-01-09 04:48:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 456 transitions. [2025-01-09 04:48:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:48:57,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:57,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:48:57,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:48:57,853 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:48:57,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:57,853 INFO L85 PathProgramCache]: Analyzing trace with hash -131812051, now seen corresponding path program 1 times [2025-01-09 04:48:57,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:57,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647474900] [2025-01-09 04:48:57,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:57,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:57,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:48:57,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:48:57,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:57,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:58,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:58,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647474900] [2025-01-09 04:48:58,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647474900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:58,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:58,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:48:58,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588258503] [2025-01-09 04:48:58,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:58,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:48:58,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:58,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:48:58,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:48:58,359 INFO L87 Difference]: Start difference. First operand 357 states and 456 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-01-09 04:48:58,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:58,842 INFO L93 Difference]: Finished difference Result 670 states and 883 transitions. [2025-01-09 04:48:58,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:48:58,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) Word has length 66 [2025-01-09 04:48:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:58,845 INFO L225 Difference]: With dead ends: 670 [2025-01-09 04:48:58,846 INFO L226 Difference]: Without dead ends: 558 [2025-01-09 04:48:58,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:48:58,847 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 1679 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:58,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 897 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:48:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-01-09 04:48:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 357. [2025-01-09 04:48:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3150289017341041) internal successors, (455), 356 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 455 transitions. [2025-01-09 04:48:58,855 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 455 transitions. Word has length 66 [2025-01-09 04:48:58,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:58,856 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 455 transitions. [2025-01-09 04:48:58,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-01-09 04:48:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 455 transitions. [2025-01-09 04:48:58,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:48:58,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:58,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:48:58,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:48:58,857 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:48:58,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:58,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2058619373, now seen corresponding path program 1 times [2025-01-09 04:48:58,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:58,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321676646] [2025-01-09 04:48:58,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:58,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:48:58,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:48:58,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:58,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:59,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:59,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321676646] [2025-01-09 04:48:59,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321676646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:59,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:59,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:48:59,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713815084] [2025-01-09 04:48:59,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:59,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:48:59,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:59,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:48:59,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:48:59,299 INFO L87 Difference]: Start difference. First operand 357 states and 455 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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-01-09 04:49:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:00,061 INFO L93 Difference]: Finished difference Result 1064 states and 1460 transitions. [2025-01-09 04:49:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:49:00,061 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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) Word has length 66 [2025-01-09 04:49:00,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:00,064 INFO L225 Difference]: With dead ends: 1064 [2025-01-09 04:49:00,064 INFO L226 Difference]: Without dead ends: 939 [2025-01-09 04:49:00,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:49:00,065 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 3379 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3379 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:00,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3379 Valid, 1364 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:49:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-01-09 04:49:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 362. [2025-01-09 04:49:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 351 states have (on average 1.3105413105413106) internal successors, (460), 361 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 460 transitions. [2025-01-09 04:49:00,073 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 460 transitions. Word has length 66 [2025-01-09 04:49:00,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:00,074 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 460 transitions. [2025-01-09 04:49:00,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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-01-09 04:49:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 460 transitions. [2025-01-09 04:49:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:49:00,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:00,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:00,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:49:00,075 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:00,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:00,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1833305997, now seen corresponding path program 1 times [2025-01-09 04:49:00,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:00,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314523530] [2025-01-09 04:49:00,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:00,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:49:00,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:49:00,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:00,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:00,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:00,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314523530] [2025-01-09 04:49:00,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314523530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:00,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:00,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:00,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062932740] [2025-01-09 04:49:00,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:00,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:00,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:00,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:00,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:00,234 INFO L87 Difference]: Start difference. First operand 362 states and 460 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-01-09 04:49:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:00,605 INFO L93 Difference]: Finished difference Result 569 states and 728 transitions. [2025-01-09 04:49:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:49:00,605 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) Word has length 66 [2025-01-09 04:49:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:00,607 INFO L225 Difference]: With dead ends: 569 [2025-01-09 04:49:00,607 INFO L226 Difference]: Without dead ends: 563 [2025-01-09 04:49:00,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:49:00,608 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1639 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:00,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 882 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:00,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-01-09 04:49:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 362. [2025-01-09 04:49:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 351 states have (on average 1.3076923076923077) internal successors, (459), 361 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 459 transitions. [2025-01-09 04:49:00,614 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 459 transitions. Word has length 66 [2025-01-09 04:49:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:00,614 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 459 transitions. [2025-01-09 04:49:00,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-01-09 04:49:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 459 transitions. [2025-01-09 04:49:00,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:49:00,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:00,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:00,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:49:00,616 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:00,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash 817551922, now seen corresponding path program 1 times [2025-01-09 04:49:00,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:00,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601121374] [2025-01-09 04:49:00,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:00,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:00,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:49:00,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:49:00,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:00,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:01,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:01,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601121374] [2025-01-09 04:49:01,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601121374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:01,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:01,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-01-09 04:49:01,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561324889] [2025-01-09 04:49:01,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:01,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 04:49:01,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:01,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 04:49:01,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:49:01,895 INFO L87 Difference]: Start difference. First operand 362 states and 459 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:05,732 INFO L93 Difference]: Finished difference Result 873 states and 1153 transitions. [2025-01-09 04:49:05,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 04:49:05,732 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 67 [2025-01-09 04:49:05,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:05,735 INFO L225 Difference]: With dead ends: 873 [2025-01-09 04:49:05,735 INFO L226 Difference]: Without dead ends: 766 [2025-01-09 04:49:05,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=333, Invalid=1923, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 04:49:05,736 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 2082 mSDsluCounter, 6145 mSDsCounter, 0 mSdLazyCounter, 3491 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2082 SdHoareTripleChecker+Valid, 6527 SdHoareTripleChecker+Invalid, 3503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:05,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2082 Valid, 6527 Invalid, 3503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3491 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 04:49:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-01-09 04:49:05,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 361. [2025-01-09 04:49:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 350 states have (on average 1.3057142857142856) internal successors, (457), 360 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 457 transitions. [2025-01-09 04:49:05,742 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 457 transitions. Word has length 67 [2025-01-09 04:49:05,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:05,742 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 457 transitions. [2025-01-09 04:49:05,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 457 transitions. [2025-01-09 04:49:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:49:05,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:05,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:05,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:49:05,743 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:05,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash 167509874, now seen corresponding path program 1 times [2025-01-09 04:49:05,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:05,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096063714] [2025-01-09 04:49:05,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:05,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:05,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:49:05,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:49:05,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:05,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:06,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:06,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096063714] [2025-01-09 04:49:06,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096063714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:06,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:06,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-01-09 04:49:06,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003516616] [2025-01-09 04:49:06,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:06,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 04:49:06,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:06,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 04:49:06,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:49:06,778 INFO L87 Difference]: Start difference. First operand 361 states and 457 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:09,414 INFO L93 Difference]: Finished difference Result 725 states and 955 transitions. [2025-01-09 04:49:09,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 04:49:09,415 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 67 [2025-01-09 04:49:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:09,417 INFO L225 Difference]: With dead ends: 725 [2025-01-09 04:49:09,417 INFO L226 Difference]: Without dead ends: 618 [2025-01-09 04:49:09,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=379, Invalid=1691, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 04:49:09,418 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 1631 mSDsluCounter, 4777 mSDsCounter, 0 mSdLazyCounter, 2588 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 5110 SdHoareTripleChecker+Invalid, 2600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:09,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 5110 Invalid, 2600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2588 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 04:49:09,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-01-09 04:49:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 367. [2025-01-09 04:49:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 356 states have (on average 1.3089887640449438) internal successors, (466), 366 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 466 transitions. [2025-01-09 04:49:09,423 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 466 transitions. Word has length 67 [2025-01-09 04:49:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:09,424 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 466 transitions. [2025-01-09 04:49:09,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 466 transitions. [2025-01-09 04:49:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:49:09,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:09,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:09,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:49:09,425 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:09,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:09,425 INFO L85 PathProgramCache]: Analyzing trace with hash 620991698, now seen corresponding path program 1 times [2025-01-09 04:49:09,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:09,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257192482] [2025-01-09 04:49:09,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:09,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:09,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:49:09,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:49:09,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:09,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:09,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:09,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257192482] [2025-01-09 04:49:09,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257192482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:09,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:09,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:49:09,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831466677] [2025-01-09 04:49:09,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:09,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:49:09,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:09,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:49:09,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:49:09,755 INFO L87 Difference]: Start difference. First operand 367 states and 466 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:10,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:10,094 INFO L93 Difference]: Finished difference Result 527 states and 703 transitions. [2025-01-09 04:49:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:49:10,094 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 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 67 [2025-01-09 04:49:10,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:10,095 INFO L225 Difference]: With dead ends: 527 [2025-01-09 04:49:10,096 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 04:49:10,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:49:10,096 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 1183 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:10,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 1546 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:49:10,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 04:49:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 340. [2025-01-09 04:49:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 330 states have (on average 1.312121212121212) internal successors, (433), 339 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 433 transitions. [2025-01-09 04:49:10,102 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 433 transitions. Word has length 67 [2025-01-09 04:49:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:10,102 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 433 transitions. [2025-01-09 04:49:10,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 433 transitions. [2025-01-09 04:49:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:49:10,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:10,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:10,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:49:10,103 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:10,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:10,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1785735868, now seen corresponding path program 1 times [2025-01-09 04:49:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:10,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524651581] [2025-01-09 04:49:10,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:10,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:10,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:49:10,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:49:10,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:10,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:10,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:10,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524651581] [2025-01-09 04:49:10,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524651581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:10,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:10,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:10,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310223963] [2025-01-09 04:49:10,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:10,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:10,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:10,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:10,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:10,247 INFO L87 Difference]: Start difference. First operand 340 states and 433 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:10,639 INFO L93 Difference]: Finished difference Result 675 states and 893 transitions. [2025-01-09 04:49:10,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:49:10,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 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 67 [2025-01-09 04:49:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:10,641 INFO L225 Difference]: With dead ends: 675 [2025-01-09 04:49:10,641 INFO L226 Difference]: Without dead ends: 550 [2025-01-09 04:49:10,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:49:10,642 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 1158 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:10,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1154 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-01-09 04:49:10,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 340. [2025-01-09 04:49:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 330 states have (on average 1.309090909090909) internal successors, (432), 339 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 432 transitions. [2025-01-09 04:49:10,647 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 432 transitions. Word has length 67 [2025-01-09 04:49:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:10,647 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 432 transitions. [2025-01-09 04:49:10,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 432 transitions. [2025-01-09 04:49:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:49:10,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:10,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:10,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:49:10,647 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:10,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1968382194, now seen corresponding path program 1 times [2025-01-09 04:49:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:10,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516138087] [2025-01-09 04:49:10,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:10,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:10,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:49:10,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:49:10,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:10,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:11,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:11,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516138087] [2025-01-09 04:49:11,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516138087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:11,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:11,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 04:49:11,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765234347] [2025-01-09 04:49:11,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:11,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 04:49:11,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:11,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 04:49:11,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-01-09 04:49:11,244 INFO L87 Difference]: Start difference. First operand 340 states and 432 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 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-01-09 04:49:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:12,605 INFO L93 Difference]: Finished difference Result 801 states and 1052 transitions. [2025-01-09 04:49:12,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:49:12,606 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 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) Word has length 68 [2025-01-09 04:49:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:12,608 INFO L225 Difference]: With dead ends: 801 [2025-01-09 04:49:12,608 INFO L226 Difference]: Without dead ends: 691 [2025-01-09 04:49:12,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=608, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:49:12,609 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 1940 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:12,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1940 Valid, 2328 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:49:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-01-09 04:49:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 338. [2025-01-09 04:49:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 328 states have (on average 1.3048780487804879) internal successors, (428), 337 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 428 transitions. [2025-01-09 04:49:12,615 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 428 transitions. Word has length 68 [2025-01-09 04:49:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:12,615 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 428 transitions. [2025-01-09 04:49:12,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 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-01-09 04:49:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 428 transitions. [2025-01-09 04:49:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:49:12,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:12,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:12,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:49:12,616 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:12,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:12,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1424994738, now seen corresponding path program 1 times [2025-01-09 04:49:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:12,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071327904] [2025-01-09 04:49:12,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:12,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:12,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:49:12,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:49:12,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:12,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:12,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071327904] [2025-01-09 04:49:12,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071327904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:12,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:12,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:49:12,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023801255] [2025-01-09 04:49:12,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:12,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:49:12,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:12,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:49:12,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:49:12,993 INFO L87 Difference]: Start difference. First operand 338 states and 428 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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-01-09 04:49:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:13,676 INFO L93 Difference]: Finished difference Result 819 states and 1068 transitions. [2025-01-09 04:49:13,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:49:13,676 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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) Word has length 68 [2025-01-09 04:49:13,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:13,678 INFO L225 Difference]: With dead ends: 819 [2025-01-09 04:49:13,678 INFO L226 Difference]: Without dead ends: 815 [2025-01-09 04:49:13,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:49:13,679 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 1358 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 2136 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:13,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 2136 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-01-09 04:49:13,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 334. [2025-01-09 04:49:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 325 states have (on average 1.3046153846153845) internal successors, (424), 333 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 424 transitions. [2025-01-09 04:49:13,684 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 424 transitions. Word has length 68 [2025-01-09 04:49:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:13,684 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 424 transitions. [2025-01-09 04:49:13,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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-01-09 04:49:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 424 transitions. [2025-01-09 04:49:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:49:13,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:13,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:13,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:49:13,685 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:13,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:13,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1956272974, now seen corresponding path program 1 times [2025-01-09 04:49:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:13,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756371362] [2025-01-09 04:49:13,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:13,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:49:13,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:49:13,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:13,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:14,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:14,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756371362] [2025-01-09 04:49:14,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756371362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:14,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:14,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-01-09 04:49:14,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966222336] [2025-01-09 04:49:14,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:14,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 04:49:14,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:14,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 04:49:14,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:49:14,368 INFO L87 Difference]: Start difference. First operand 334 states and 424 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 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-01-09 04:49:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:16,159 INFO L93 Difference]: Finished difference Result 624 states and 816 transitions. [2025-01-09 04:49:16,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 04:49:16,159 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 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) Word has length 68 [2025-01-09 04:49:16,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:16,161 INFO L225 Difference]: With dead ends: 624 [2025-01-09 04:49:16,161 INFO L226 Difference]: Without dead ends: 617 [2025-01-09 04:49:16,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=302, Invalid=1420, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 04:49:16,161 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 1266 mSDsluCounter, 4976 mSDsCounter, 0 mSdLazyCounter, 2503 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 5370 SdHoareTripleChecker+Invalid, 2514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:16,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 5370 Invalid, 2514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2503 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:49:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-01-09 04:49:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 334. [2025-01-09 04:49:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 325 states have (on average 1.3015384615384615) internal successors, (423), 333 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 423 transitions. [2025-01-09 04:49:16,167 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 423 transitions. Word has length 68 [2025-01-09 04:49:16,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:16,167 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 423 transitions. [2025-01-09 04:49:16,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 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-01-09 04:49:16,168 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 423 transitions. [2025-01-09 04:49:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:49:16,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:16,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:16,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:49:16,169 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:16,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:16,169 INFO L85 PathProgramCache]: Analyzing trace with hash -30360855, now seen corresponding path program 1 times [2025-01-09 04:49:16,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:16,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109026017] [2025-01-09 04:49:16,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:16,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:16,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:49:16,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:49:16,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:16,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:16,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:16,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109026017] [2025-01-09 04:49:16,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109026017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:16,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:16,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:49:16,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261126910] [2025-01-09 04:49:16,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:16,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:49:16,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:16,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:49:16,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:49:16,574 INFO L87 Difference]: Start difference. First operand 334 states and 423 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 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-01-09 04:49:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:16,905 INFO L93 Difference]: Finished difference Result 510 states and 675 transitions. [2025-01-09 04:49:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:49:16,905 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 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) Word has length 68 [2025-01-09 04:49:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:16,906 INFO L225 Difference]: With dead ends: 510 [2025-01-09 04:49:16,909 INFO L226 Difference]: Without dead ends: 364 [2025-01-09 04:49:16,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:49:16,911 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 950 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:16,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 1224 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:49:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-01-09 04:49:16,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 294. [2025-01-09 04:49:16,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 287 states have (on average 1.3066202090592334) internal successors, (375), 293 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 375 transitions. [2025-01-09 04:49:16,914 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 375 transitions. Word has length 68 [2025-01-09 04:49:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:16,915 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 375 transitions. [2025-01-09 04:49:16,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 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-01-09 04:49:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 375 transitions. [2025-01-09 04:49:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:49:16,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:16,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:16,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:49:16,915 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:16,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:16,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1763841774, now seen corresponding path program 1 times [2025-01-09 04:49:16,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:16,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346124453] [2025-01-09 04:49:16,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:16,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:16,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:49:16,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:49:16,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:16,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:17,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:17,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346124453] [2025-01-09 04:49:17,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346124453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:17,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:17,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:49:17,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959530291] [2025-01-09 04:49:17,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:17,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:49:17,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:17,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:49:17,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:49:17,189 INFO L87 Difference]: Start difference. First operand 294 states and 375 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-01-09 04:49:17,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:17,453 INFO L93 Difference]: Finished difference Result 531 states and 715 transitions. [2025-01-09 04:49:17,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:49:17,453 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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) Word has length 68 [2025-01-09 04:49:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:17,454 INFO L225 Difference]: With dead ends: 531 [2025-01-09 04:49:17,454 INFO L226 Difference]: Without dead ends: 371 [2025-01-09 04:49:17,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:49:17,455 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 856 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:17,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 798 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:49:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-09 04:49:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 240. [2025-01-09 04:49:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 239 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 310 transitions. [2025-01-09 04:49:17,458 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 310 transitions. Word has length 68 [2025-01-09 04:49:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:17,458 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 310 transitions. [2025-01-09 04:49:17,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-01-09 04:49:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 310 transitions. [2025-01-09 04:49:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:49:17,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:17,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:17,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:49:17,459 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:17,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1452889883, now seen corresponding path program 1 times [2025-01-09 04:49:17,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:17,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744952381] [2025-01-09 04:49:17,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:17,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:17,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:49:17,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:49:17,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:17,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:17,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:17,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744952381] [2025-01-09 04:49:17,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744952381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:17,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:17,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:49:17,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603249951] [2025-01-09 04:49:17,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:17,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:49:17,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:17,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:49:17,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:49:17,843 INFO L87 Difference]: Start difference. First operand 240 states and 310 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:18,427 INFO L93 Difference]: Finished difference Result 585 states and 804 transitions. [2025-01-09 04:49:18,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:49:18,428 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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 69 [2025-01-09 04:49:18,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:18,429 INFO L225 Difference]: With dead ends: 585 [2025-01-09 04:49:18,429 INFO L226 Difference]: Without dead ends: 458 [2025-01-09 04:49:18,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:49:18,430 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 702 mSDsluCounter, 2169 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 2459 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:18,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 2459 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-01-09 04:49:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 254. [2025-01-09 04:49:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 250 states have (on average 1.312) internal successors, (328), 253 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 328 transitions. [2025-01-09 04:49:18,433 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 328 transitions. Word has length 69 [2025-01-09 04:49:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:18,433 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 328 transitions. [2025-01-09 04:49:18,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:18,434 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 328 transitions. [2025-01-09 04:49:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:49:18,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:18,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:18,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:49:18,435 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:18,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash -957086542, now seen corresponding path program 1 times [2025-01-09 04:49:18,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:18,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723012415] [2025-01-09 04:49:18,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:18,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:18,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:49:18,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:49:18,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:18,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:18,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-01-09 04:49:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723012415] [2025-01-09 04:49:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723012415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:18,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:18,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:18,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600590444] [2025-01-09 04:49:18,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:18,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:18,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:18,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:18,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:18,562 INFO L87 Difference]: Start difference. First operand 254 states and 328 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 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-01-09 04:49:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:18,833 INFO L93 Difference]: Finished difference Result 540 states and 728 transitions. [2025-01-09 04:49:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:49:18,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 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) Word has length 70 [2025-01-09 04:49:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:18,834 INFO L225 Difference]: With dead ends: 540 [2025-01-09 04:49:18,834 INFO L226 Difference]: Without dead ends: 400 [2025-01-09 04:49:18,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:49:18,835 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 657 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:18,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 683 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:49:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-09 04:49:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 254. [2025-01-09 04:49:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 250 states have (on average 1.296) internal successors, (324), 253 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 324 transitions. [2025-01-09 04:49:18,840 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 324 transitions. Word has length 70 [2025-01-09 04:49:18,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:18,841 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 324 transitions. [2025-01-09 04:49:18,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 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-01-09 04:49:18,841 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 324 transitions. [2025-01-09 04:49:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:49:18,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:18,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:18,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:49:18,842 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:18,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:18,842 INFO L85 PathProgramCache]: Analyzing trace with hash -195116297, now seen corresponding path program 1 times [2025-01-09 04:49:18,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:18,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103904713] [2025-01-09 04:49:18,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:18,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:18,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:49:18,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:49:18,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:18,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:19,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:19,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103904713] [2025-01-09 04:49:19,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103904713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:19,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:19,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 04:49:19,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959547325] [2025-01-09 04:49:19,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:19,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 04:49:19,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:19,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 04:49:19,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:49:19,558 INFO L87 Difference]: Start difference. First operand 254 states and 324 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 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-01-09 04:49:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:20,293 INFO L93 Difference]: Finished difference Result 502 states and 681 transitions. [2025-01-09 04:49:20,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 04:49:20,293 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 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) Word has length 70 [2025-01-09 04:49:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:20,294 INFO L225 Difference]: With dead ends: 502 [2025-01-09 04:49:20,294 INFO L226 Difference]: Without dead ends: 375 [2025-01-09 04:49:20,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:49:20,295 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 385 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:20,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 2415 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-09 04:49:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 219. [2025-01-09 04:49:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 217 states have (on average 1.294930875576037) internal successors, (281), 218 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 281 transitions. [2025-01-09 04:49:20,299 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 281 transitions. Word has length 70 [2025-01-09 04:49:20,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:20,299 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 281 transitions. [2025-01-09 04:49:20,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 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-01-09 04:49:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 281 transitions. [2025-01-09 04:49:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:49:20,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:20,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:20,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:49:20,300 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:20,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash -918116841, now seen corresponding path program 1 times [2025-01-09 04:49:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:20,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777592181] [2025-01-09 04:49:20,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:20,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:20,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:49:20,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:49:20,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:20,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:21,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:21,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777592181] [2025-01-09 04:49:21,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777592181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:21,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:21,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-01-09 04:49:21,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997596273] [2025-01-09 04:49:21,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:21,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 04:49:21,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:21,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 04:49:21,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:49:21,181 INFO L87 Difference]: Start difference. First operand 219 states and 281 transitions. Second operand has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 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-01-09 04:49:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:22,127 INFO L93 Difference]: Finished difference Result 361 states and 478 transitions. [2025-01-09 04:49:22,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 04:49:22,128 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 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) Word has length 72 [2025-01-09 04:49:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:22,128 INFO L225 Difference]: With dead ends: 361 [2025-01-09 04:49:22,128 INFO L226 Difference]: Without dead ends: 355 [2025-01-09 04:49:22,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=290, Invalid=1350, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 04:49:22,133 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 355 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:22,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1743 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:49:22,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-09 04:49:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 232. [2025-01-09 04:49:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 230 states have (on average 1.291304347826087) internal successors, (297), 231 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 297 transitions. [2025-01-09 04:49:22,138 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 297 transitions. Word has length 72 [2025-01-09 04:49:22,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:22,138 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 297 transitions. [2025-01-09 04:49:22,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 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-01-09 04:49:22,138 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 297 transitions. [2025-01-09 04:49:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:49:22,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:22,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:22,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:49:22,139 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:22,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:22,139 INFO L85 PathProgramCache]: Analyzing trace with hash 370177890, now seen corresponding path program 1 times [2025-01-09 04:49:22,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:22,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611469090] [2025-01-09 04:49:22,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:22,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:22,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:49:22,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:49:22,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:22,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:23,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:23,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611469090] [2025-01-09 04:49:23,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611469090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:23,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:23,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-01-09 04:49:23,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883331424] [2025-01-09 04:49:23,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:23,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:49:23,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:23,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:49:23,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:49:23,262 INFO L87 Difference]: Start difference. First operand 232 states and 297 transitions. Second operand has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:24,595 INFO L93 Difference]: Finished difference Result 368 states and 487 transitions. [2025-01-09 04:49:24,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 04:49:24,595 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 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 73 [2025-01-09 04:49:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:24,596 INFO L225 Difference]: With dead ends: 368 [2025-01-09 04:49:24,596 INFO L226 Difference]: Without dead ends: 362 [2025-01-09 04:49:24,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=248, Invalid=1158, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 04:49:24,597 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 560 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:24,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1869 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:49:24,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-01-09 04:49:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 233. [2025-01-09 04:49:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 231 states have (on average 1.29004329004329) internal successors, (298), 232 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 298 transitions. [2025-01-09 04:49:24,606 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 298 transitions. Word has length 73 [2025-01-09 04:49:24,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:24,607 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 298 transitions. [2025-01-09 04:49:24,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:24,607 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 298 transitions. [2025-01-09 04:49:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:49:24,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:24,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:24,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:49:24,607 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:24,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1339392549, now seen corresponding path program 1 times [2025-01-09 04:49:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:24,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785169455] [2025-01-09 04:49:24,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:24,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:49:24,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:49:24,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:24,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:24,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:24,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785169455] [2025-01-09 04:49:24,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785169455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:24,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:24,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:49:24,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675924577] [2025-01-09 04:49:24,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:24,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:49:24,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:24,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:49:24,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:49:24,999 INFO L87 Difference]: Start difference. First operand 233 states and 298 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:25,587 INFO L93 Difference]: Finished difference Result 620 states and 849 transitions. [2025-01-09 04:49:25,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:49:25,588 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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 73 [2025-01-09 04:49:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:25,590 INFO L225 Difference]: With dead ends: 620 [2025-01-09 04:49:25,590 INFO L226 Difference]: Without dead ends: 614 [2025-01-09 04:49:25,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:49:25,595 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 803 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:25,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1855 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:25,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-01-09 04:49:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 213. [2025-01-09 04:49:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.2924528301886793) internal successors, (274), 212 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 274 transitions. [2025-01-09 04:49:25,602 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 274 transitions. Word has length 73 [2025-01-09 04:49:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:25,602 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 274 transitions. [2025-01-09 04:49:25,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 274 transitions. [2025-01-09 04:49:25,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:49:25,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:25,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:25,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:49:25,603 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:25,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:25,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1364481581, now seen corresponding path program 1 times [2025-01-09 04:49:25,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:25,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283352339] [2025-01-09 04:49:25,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:25,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:25,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:49:25,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:49:25,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:25,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:25,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:25,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283352339] [2025-01-09 04:49:25,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283352339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:25,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:25,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:49:25,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952204248] [2025-01-09 04:49:25,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:25,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:49:25,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:25,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:49:25,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:25,725 INFO L87 Difference]: Start difference. First operand 213 states and 274 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:25,859 INFO L93 Difference]: Finished difference Result 1061 states and 1538 transitions. [2025-01-09 04:49:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:49:25,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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 96 [2025-01-09 04:49:25,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:25,863 INFO L225 Difference]: With dead ends: 1061 [2025-01-09 04:49:25,863 INFO L226 Difference]: Without dead ends: 955 [2025-01-09 04:49:25,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:49:25,864 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 906 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:25,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 955 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:49:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-01-09 04:49:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 317. [2025-01-09 04:49:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.3512658227848102) internal successors, (427), 316 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 427 transitions. [2025-01-09 04:49:25,877 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 427 transitions. Word has length 96 [2025-01-09 04:49:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:25,877 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 427 transitions. [2025-01-09 04:49:25,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 427 transitions. [2025-01-09 04:49:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:49:25,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:25,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:25,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:49:25,878 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:25,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1426852022, now seen corresponding path program 1 times [2025-01-09 04:49:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:25,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519627988] [2025-01-09 04:49:25,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:25,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:49:25,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:49:25,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:25,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:25,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:25,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519627988] [2025-01-09 04:49:25,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519627988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:25,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:25,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:49:25,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544234467] [2025-01-09 04:49:25,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:25,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:49:25,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:25,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:49:25,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:25,988 INFO L87 Difference]: Start difference. First operand 317 states and 427 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:26,069 INFO L93 Difference]: Finished difference Result 1263 states and 1825 transitions. [2025-01-09 04:49:26,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:49:26,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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 98 [2025-01-09 04:49:26,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:26,072 INFO L225 Difference]: With dead ends: 1263 [2025-01-09 04:49:26,072 INFO L226 Difference]: Without dead ends: 1053 [2025-01-09 04:49:26,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:26,077 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 655 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:26,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 670 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:49:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2025-01-09 04:49:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 525. [2025-01-09 04:49:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 524 states have (on average 1.4026717557251909) internal successors, (735), 524 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 735 transitions. [2025-01-09 04:49:26,098 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 735 transitions. Word has length 98 [2025-01-09 04:49:26,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:26,098 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 735 transitions. [2025-01-09 04:49:26,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 735 transitions. [2025-01-09 04:49:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:49:26,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:26,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:26,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:49:26,100 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:26,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:26,100 INFO L85 PathProgramCache]: Analyzing trace with hash 645902315, now seen corresponding path program 1 times [2025-01-09 04:49:26,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:26,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801450228] [2025-01-09 04:49:26,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:26,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:26,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:49:26,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:49:26,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:26,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:26,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:26,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801450228] [2025-01-09 04:49:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801450228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:26,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:26,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:49:26,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14088397] [2025-01-09 04:49:26,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:26,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:49:26,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:26,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:49:26,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:26,293 INFO L87 Difference]: Start difference. First operand 525 states and 735 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:26,371 INFO L93 Difference]: Finished difference Result 945 states and 1355 transitions. [2025-01-09 04:49:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:49:26,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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 98 [2025-01-09 04:49:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:26,372 INFO L225 Difference]: With dead ends: 945 [2025-01-09 04:49:26,372 INFO L226 Difference]: Without dead ends: 527 [2025-01-09 04:49:26,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:49:26,376 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 138 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:26,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 381 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-01-09 04:49:26,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2025-01-09 04:49:26,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 524 states have (on average 1.3950381679389312) internal successors, (731), 524 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 731 transitions. [2025-01-09 04:49:26,389 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 731 transitions. Word has length 98 [2025-01-09 04:49:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:26,389 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 731 transitions. [2025-01-09 04:49:26,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 731 transitions. [2025-01-09 04:49:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:49:26,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:26,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:26,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:49:26,390 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:26,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:26,390 INFO L85 PathProgramCache]: Analyzing trace with hash 579408803, now seen corresponding path program 1 times [2025-01-09 04:49:26,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:26,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140413863] [2025-01-09 04:49:26,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:26,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:26,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:49:26,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:49:26,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:26,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:26,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:26,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140413863] [2025-01-09 04:49:26,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140413863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:26,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:26,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:49:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316711172] [2025-01-09 04:49:26,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:26,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:49:26,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:26,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:49:26,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:26,429 INFO L87 Difference]: Start difference. First operand 525 states and 731 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:26,460 INFO L93 Difference]: Finished difference Result 1309 states and 1873 transitions. [2025-01-09 04:49:26,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:49:26,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 98 [2025-01-09 04:49:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:26,463 INFO L225 Difference]: With dead ends: 1309 [2025-01-09 04:49:26,463 INFO L226 Difference]: Without dead ends: 891 [2025-01-09 04:49:26,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:26,464 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 67 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:26,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 374 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-01-09 04:49:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2025-01-09 04:49:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 1.3975225225225225) internal successors, (1241), 888 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1241 transitions. [2025-01-09 04:49:26,472 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1241 transitions. Word has length 98 [2025-01-09 04:49:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:26,472 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1241 transitions. [2025-01-09 04:49:26,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,472 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1241 transitions. [2025-01-09 04:49:26,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:49:26,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:26,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:26,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:49:26,473 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:26,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:26,474 INFO L85 PathProgramCache]: Analyzing trace with hash 628880202, now seen corresponding path program 1 times [2025-01-09 04:49:26,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:26,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270522583] [2025-01-09 04:49:26,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:26,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:26,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:49:26,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:49:26,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:26,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:26,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:26,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270522583] [2025-01-09 04:49:26,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270522583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:26,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:26,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:49:26,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334669108] [2025-01-09 04:49:26,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:26,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:49:26,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:26,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:49:26,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:26,565 INFO L87 Difference]: Start difference. First operand 889 states and 1241 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:26,653 INFO L93 Difference]: Finished difference Result 2655 states and 3782 transitions. [2025-01-09 04:49:26,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:49:26,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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 98 [2025-01-09 04:49:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:26,658 INFO L225 Difference]: With dead ends: 2655 [2025-01-09 04:49:26,659 INFO L226 Difference]: Without dead ends: 2263 [2025-01-09 04:49:26,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:26,660 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 622 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:26,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 684 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:49:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2025-01-09 04:49:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1475. [2025-01-09 04:49:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1474 states have (on average 1.4118046132971507) internal successors, (2081), 1474 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2081 transitions. [2025-01-09 04:49:26,676 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2081 transitions. Word has length 98 [2025-01-09 04:49:26,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:26,677 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 2081 transitions. [2025-01-09 04:49:26,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2081 transitions. [2025-01-09 04:49:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:49:26,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:26,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:26,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:49:26,678 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:26,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:26,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1790937782, now seen corresponding path program 1 times [2025-01-09 04:49:26,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:26,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818373935] [2025-01-09 04:49:26,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:26,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:26,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:49:26,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:49:26,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:26,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:26,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:26,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818373935] [2025-01-09 04:49:26,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818373935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:26,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:26,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:49:26,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291871800] [2025-01-09 04:49:26,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:26,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:49:26,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:26,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:49:26,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:26,826 INFO L87 Difference]: Start difference. First operand 1475 states and 2081 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:26,903 INFO L93 Difference]: Finished difference Result 3045 states and 4342 transitions. [2025-01-09 04:49:26,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:49:26,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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 98 [2025-01-09 04:49:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:26,910 INFO L225 Difference]: With dead ends: 3045 [2025-01-09 04:49:26,910 INFO L226 Difference]: Without dead ends: 2653 [2025-01-09 04:49:26,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:26,911 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 589 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:26,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 759 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:49:26,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2025-01-09 04:49:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1865. [2025-01-09 04:49:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1864 states have (on average 1.4168454935622317) internal successors, (2641), 1864 states have internal predecessors, (2641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2641 transitions. [2025-01-09 04:49:26,951 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2641 transitions. Word has length 98 [2025-01-09 04:49:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:26,952 INFO L471 AbstractCegarLoop]: Abstraction has 1865 states and 2641 transitions. [2025-01-09 04:49:26,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2641 transitions. [2025-01-09 04:49:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:49:26,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:26,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:26,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:49:26,953 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:26,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash -686393014, now seen corresponding path program 1 times [2025-01-09 04:49:26,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:26,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118681913] [2025-01-09 04:49:26,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:26,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:26,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:49:26,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:49:26,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:26,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:27,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:27,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118681913] [2025-01-09 04:49:27,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118681913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:27,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:27,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:49:27,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150008347] [2025-01-09 04:49:27,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:27,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:49:27,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:27,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:49:27,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:27,053 INFO L87 Difference]: Start difference. First operand 1865 states and 2641 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:27,115 INFO L93 Difference]: Finished difference Result 3435 states and 4902 transitions. [2025-01-09 04:49:27,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:49:27,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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 98 [2025-01-09 04:49:27,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:27,123 INFO L225 Difference]: With dead ends: 3435 [2025-01-09 04:49:27,123 INFO L226 Difference]: Without dead ends: 3043 [2025-01-09 04:49:27,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:27,127 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 648 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:27,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 773 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2025-01-09 04:49:27,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 2255. [2025-01-09 04:49:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 2254 states have (on average 1.4201419698314108) internal successors, (3201), 2254 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3201 transitions. [2025-01-09 04:49:27,157 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3201 transitions. Word has length 98 [2025-01-09 04:49:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:27,157 INFO L471 AbstractCegarLoop]: Abstraction has 2255 states and 3201 transitions. [2025-01-09 04:49:27,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3201 transitions. [2025-01-09 04:49:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:49:27,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:27,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:27,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:49:27,162 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:27,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:27,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1897778033, now seen corresponding path program 1 times [2025-01-09 04:49:27,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:27,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598355333] [2025-01-09 04:49:27,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:27,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:27,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:49:27,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:49:27,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:27,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:27,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:27,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598355333] [2025-01-09 04:49:27,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598355333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:27,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:27,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:49:27,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497170871] [2025-01-09 04:49:27,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:27,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:49:27,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:27,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:49:27,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:27,290 INFO L87 Difference]: Start difference. First operand 2255 states and 3201 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:27,326 INFO L93 Difference]: Finished difference Result 5715 states and 8137 transitions. [2025-01-09 04:49:27,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:49:27,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 99 [2025-01-09 04:49:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:27,338 INFO L225 Difference]: With dead ends: 5715 [2025-01-09 04:49:27,341 INFO L226 Difference]: Without dead ends: 3567 [2025-01-09 04:49:27,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:27,344 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 78 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:27,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 345 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2025-01-09 04:49:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3389. [2025-01-09 04:49:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3389 states, 3388 states have (on average 1.406434474616293) internal successors, (4765), 3388 states have internal predecessors, (4765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 3389 states and 4765 transitions. [2025-01-09 04:49:27,403 INFO L78 Accepts]: Start accepts. Automaton has 3389 states and 4765 transitions. Word has length 99 [2025-01-09 04:49:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:27,403 INFO L471 AbstractCegarLoop]: Abstraction has 3389 states and 4765 transitions. [2025-01-09 04:49:27,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3389 states and 4765 transitions. [2025-01-09 04:49:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:49:27,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:27,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:27,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:49:27,405 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:27,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:27,406 INFO L85 PathProgramCache]: Analyzing trace with hash 642959826, now seen corresponding path program 1 times [2025-01-09 04:49:27,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:27,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947553384] [2025-01-09 04:49:27,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:27,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:27,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:49:27,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:49:27,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:27,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:27,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:27,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947553384] [2025-01-09 04:49:27,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947553384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:27,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:27,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:49:27,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532748649] [2025-01-09 04:49:27,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:27,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:49:27,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:27,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:49:27,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:27,483 INFO L87 Difference]: Start difference. First operand 3389 states and 4765 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:27,516 INFO L93 Difference]: Finished difference Result 9689 states and 13601 transitions. [2025-01-09 04:49:27,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:49:27,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 100 [2025-01-09 04:49:27,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:27,526 INFO L225 Difference]: With dead ends: 9689 [2025-01-09 04:49:27,527 INFO L226 Difference]: Without dead ends: 6407 [2025-01-09 04:49:27,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:27,530 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 71 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:27,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 346 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6407 states. [2025-01-09 04:49:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6407 to 6141. [2025-01-09 04:49:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6141 states, 6140 states have (on average 1.3933224755700326) internal successors, (8555), 6140 states have internal predecessors, (8555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 8555 transitions. [2025-01-09 04:49:27,639 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 8555 transitions. Word has length 100 [2025-01-09 04:49:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:27,639 INFO L471 AbstractCegarLoop]: Abstraction has 6141 states and 8555 transitions. [2025-01-09 04:49:27,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 8555 transitions. [2025-01-09 04:49:27,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:49:27,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:27,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:27,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 04:49:27,645 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:27,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:27,646 INFO L85 PathProgramCache]: Analyzing trace with hash -563977445, now seen corresponding path program 1 times [2025-01-09 04:49:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:27,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474299359] [2025-01-09 04:49:27,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:27,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:49:27,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:49:27,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:27,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:27,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:27,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474299359] [2025-01-09 04:49:27,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474299359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:27,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:27,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:49:27,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002290111] [2025-01-09 04:49:27,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:27,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:49:27,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:27,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:49:27,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:27,744 INFO L87 Difference]: Start difference. First operand 6141 states and 8555 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:27,776 INFO L93 Difference]: Finished difference Result 17681 states and 24509 transitions. [2025-01-09 04:49:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:49:27,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2025-01-09 04:49:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:27,791 INFO L225 Difference]: With dead ends: 17681 [2025-01-09 04:49:27,792 INFO L226 Difference]: Without dead ends: 11647 [2025-01-09 04:49:27,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:27,799 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 64 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:27,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 346 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11647 states. [2025-01-09 04:49:27,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11647 to 11117. [2025-01-09 04:49:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11117 states, 11116 states have (on average 1.3743252968693775) internal successors, (15277), 11116 states have internal predecessors, (15277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11117 states to 11117 states and 15277 transitions. [2025-01-09 04:49:27,928 INFO L78 Accepts]: Start accepts. Automaton has 11117 states and 15277 transitions. Word has length 101 [2025-01-09 04:49:27,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:27,929 INFO L471 AbstractCegarLoop]: Abstraction has 11117 states and 15277 transitions. [2025-01-09 04:49:27,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 11117 states and 15277 transitions. [2025-01-09 04:49:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 04:49:27,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:27,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:27,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:49:27,930 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:27,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:27,930 INFO L85 PathProgramCache]: Analyzing trace with hash 573353758, now seen corresponding path program 1 times [2025-01-09 04:49:27,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:27,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52382784] [2025-01-09 04:49:27,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:27,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:27,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 04:49:27,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 04:49:27,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:27,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:28,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:28,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52382784] [2025-01-09 04:49:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52382784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:28,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:49:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968011967] [2025-01-09 04:49:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:28,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:49:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:28,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:49:28,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:28,043 INFO L87 Difference]: Start difference. First operand 11117 states and 15277 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:28,091 INFO L93 Difference]: Finished difference Result 32081 states and 43751 transitions. [2025-01-09 04:49:28,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:49:28,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 102 [2025-01-09 04:49:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:28,123 INFO L225 Difference]: With dead ends: 32081 [2025-01-09 04:49:28,123 INFO L226 Difference]: Without dead ends: 21071 [2025-01-09 04:49:28,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:28,136 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 54 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:28,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 345 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21071 states. [2025-01-09 04:49:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21071 to 20013. [2025-01-09 04:49:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20013 states, 20012 states have (on average 1.349440335798521) internal successors, (27005), 20012 states have internal predecessors, (27005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:28,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20013 states to 20013 states and 27005 transitions. [2025-01-09 04:49:28,390 INFO L78 Accepts]: Start accepts. Automaton has 20013 states and 27005 transitions. Word has length 102 [2025-01-09 04:49:28,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:28,391 INFO L471 AbstractCegarLoop]: Abstraction has 20013 states and 27005 transitions. [2025-01-09 04:49:28,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:28,391 INFO L276 IsEmpty]: Start isEmpty. Operand 20013 states and 27005 transitions. [2025-01-09 04:49:28,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:49:28,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:28,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:28,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 04:49:28,392 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:28,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:28,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1488377255, now seen corresponding path program 1 times [2025-01-09 04:49:28,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:28,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484516894] [2025-01-09 04:49:28,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:28,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:28,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:49:28,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:49:28,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:28,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:28,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:28,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484516894] [2025-01-09 04:49:28,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484516894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:28,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:28,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:49:28,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798101453] [2025-01-09 04:49:28,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:28,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:49:28,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:28,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:49:28,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:28,777 INFO L87 Difference]: Start difference. First operand 20013 states and 27005 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 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-01-09 04:49:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:28,840 INFO L93 Difference]: Finished difference Result 20495 states and 27646 transitions. [2025-01-09 04:49:28,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:49:28,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 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) Word has length 103 [2025-01-09 04:49:28,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:28,870 INFO L225 Difference]: With dead ends: 20495 [2025-01-09 04:49:28,870 INFO L226 Difference]: Without dead ends: 20493 [2025-01-09 04:49:28,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:28,878 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:28,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 778 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:28,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20493 states. [2025-01-09 04:49:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20493 to 20493. [2025-01-09 04:49:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20493 states, 20492 states have (on average 1.3318856138981066) internal successors, (27293), 20492 states have internal predecessors, (27293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20493 states to 20493 states and 27293 transitions. [2025-01-09 04:49:29,112 INFO L78 Accepts]: Start accepts. Automaton has 20493 states and 27293 transitions. Word has length 103 [2025-01-09 04:49:29,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:29,112 INFO L471 AbstractCegarLoop]: Abstraction has 20493 states and 27293 transitions. [2025-01-09 04:49:29,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 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-01-09 04:49:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 20493 states and 27293 transitions. [2025-01-09 04:49:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:49:29,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:29,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:29,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 04:49:29,113 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:29,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:29,113 INFO L85 PathProgramCache]: Analyzing trace with hash -108390554, now seen corresponding path program 1 times [2025-01-09 04:49:29,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:29,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326786501] [2025-01-09 04:49:29,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:29,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:29,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:49:29,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:49:29,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:29,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:29,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:29,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326786501] [2025-01-09 04:49:29,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326786501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:29,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:29,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:49:29,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21967547] [2025-01-09 04:49:29,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:29,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:49:29,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:29,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:49:29,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:29,216 INFO L87 Difference]: Start difference. First operand 20493 states and 27293 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 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-01-09 04:49:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:29,276 INFO L93 Difference]: Finished difference Result 41521 states and 55335 transitions. [2025-01-09 04:49:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:49:29,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 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) Word has length 103 [2025-01-09 04:49:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:29,303 INFO L225 Difference]: With dead ends: 41521 [2025-01-09 04:49:29,303 INFO L226 Difference]: Without dead ends: 21135 [2025-01-09 04:49:29,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:29,321 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 86 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:29,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 289 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21135 states. [2025-01-09 04:49:29,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21135 to 21133. [2025-01-09 04:49:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21133 states, 21132 states have (on average 1.3150198750709825) internal successors, (27789), 21132 states have internal predecessors, (27789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21133 states to 21133 states and 27789 transitions. [2025-01-09 04:49:29,627 INFO L78 Accepts]: Start accepts. Automaton has 21133 states and 27789 transitions. Word has length 103 [2025-01-09 04:49:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:29,628 INFO L471 AbstractCegarLoop]: Abstraction has 21133 states and 27789 transitions. [2025-01-09 04:49:29,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 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-01-09 04:49:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 21133 states and 27789 transitions. [2025-01-09 04:49:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 04:49:29,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:29,630 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:29,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 04:49:29,631 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:29,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:29,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1221771837, now seen corresponding path program 1 times [2025-01-09 04:49:29,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:29,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363093959] [2025-01-09 04:49:29,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:29,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:29,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 04:49:29,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 04:49:29,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:29,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:30,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:30,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363093959] [2025-01-09 04:49:30,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363093959] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:49:30,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290205948] [2025-01-09 04:49:30,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:30,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:49:30,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:49:30,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:49:30,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:49:30,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 04:49:30,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 04:49:30,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:30,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:30,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 04:49:30,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:49:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:31,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:49:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:32,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290205948] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:49:32,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:49:32,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-01-09 04:49:32,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978596613] [2025-01-09 04:49:32,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:49:32,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 04:49:32,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:32,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 04:49:32,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:49:32,384 INFO L87 Difference]: Start difference. First operand 21133 states and 27789 transitions. Second operand has 29 states, 29 states have (on average 12.0) internal successors, (348), 28 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:37,418 INFO L93 Difference]: Finished difference Result 198662 states and 261005 transitions. [2025-01-09 04:49:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-01-09 04:49:37,419 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 12.0) internal successors, (348), 28 states have internal predecessors, (348), 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 130 [2025-01-09 04:49:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:37,684 INFO L225 Difference]: With dead ends: 198662 [2025-01-09 04:49:37,684 INFO L226 Difference]: Without dead ends: 177636 [2025-01-09 04:49:37,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7108 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3164, Invalid=18298, Unknown=0, NotChecked=0, Total=21462 [2025-01-09 04:49:37,781 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 2834 mSDsluCounter, 3137 mSDsCounter, 0 mSdLazyCounter, 3224 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2834 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:37,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2834 Valid, 3330 Invalid, 3261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3224 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 04:49:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177636 states. [2025-01-09 04:49:39,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177636 to 77935. [2025-01-09 04:49:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77935 states, 77934 states have (on average 1.3032437703698) internal successors, (101567), 77934 states have internal predecessors, (101567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77935 states to 77935 states and 101567 transitions. [2025-01-09 04:49:39,587 INFO L78 Accepts]: Start accepts. Automaton has 77935 states and 101567 transitions. Word has length 130 [2025-01-09 04:49:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:39,587 INFO L471 AbstractCegarLoop]: Abstraction has 77935 states and 101567 transitions. [2025-01-09 04:49:39,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 12.0) internal successors, (348), 28 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 77935 states and 101567 transitions. [2025-01-09 04:49:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:49:39,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:39,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:39,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:49:39,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:49:39,796 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:39,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:39,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1853159154, now seen corresponding path program 1 times [2025-01-09 04:49:39,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:39,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398985] [2025-01-09 04:49:39,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:39,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:39,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:49:39,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:49:39,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:39,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:40,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:40,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398985] [2025-01-09 04:49:40,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398985] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:49:40,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618626907] [2025-01-09 04:49:40,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:40,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:49:40,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:49:40,584 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:49:40,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:49:40,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:49:40,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:49:40,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:40,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:40,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 04:49:40,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:49:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:41,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:49:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:42,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618626907] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:49:42,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:49:42,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 32 [2025-01-09 04:49:42,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500660082] [2025-01-09 04:49:42,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:49:42,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 04:49:42,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:42,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 04:49:42,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2025-01-09 04:49:42,454 INFO L87 Difference]: Start difference. First operand 77935 states and 101567 transitions. Second operand has 32 states, 32 states have (on average 11.3125) internal successors, (362), 32 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:04,592 INFO L93 Difference]: Finished difference Result 642507 states and 830229 transitions. [2025-01-09 04:50:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 386 states. [2025-01-09 04:50:04,592 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 11.3125) internal successors, (362), 32 states have internal predecessors, (362), 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 131 [2025-01-09 04:50:04,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:06,067 INFO L225 Difference]: With dead ends: 642507 [2025-01-09 04:50:06,068 INFO L226 Difference]: Without dead ends: 564687