./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d7ece5c4a9a1765b3b43243827c3f464d1b8786fc999bf2c8e86adac4d3a79a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:14:44,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:14:44,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:14:44,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:14:44,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:14:44,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:14:44,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:14:44,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:14:44,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:14:44,657 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:14:44,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:14:44,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:14:44,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:14:44,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:14:44,657 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:14:44,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:14:44,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:14:44,659 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:14:44,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:14:44,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:14:44,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:14:44,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:14:44,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:14:44,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:14:44,660 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:14:44,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:14:44,661 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:14:44,661 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:14:44,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:14:44,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:14:44,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:14:44,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:14:44,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:14:44,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:14:44,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:14:44,662 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:14:44,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:14:44,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:14:44,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:14:44,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:14:44,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:14:44,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:14:44,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:14:44,662 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d7ece5c4a9a1765b3b43243827c3f464d1b8786fc999bf2c8e86adac4d3a79a [2025-03-03 15:14:44,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:14:44,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:14:44,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:14:44,876 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:14:44,877 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:14:44,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-03 15:14:45,966 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927b7de38/0c1eb12014604bbf9dffffd3a6b1daba/FLAGac1c074f3 [2025-03-03 15:14:46,341 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:14:46,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-03 15:14:46,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927b7de38/0c1eb12014604bbf9dffffd3a6b1daba/FLAGac1c074f3 [2025-03-03 15:14:46,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927b7de38/0c1eb12014604bbf9dffffd3a6b1daba [2025-03-03 15:14:46,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:14:46,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:14:46,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:14:46,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:14:46,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:14:46,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:14:46" (1/1) ... [2025-03-03 15:14:46,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123f2c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:46, skipping insertion in model container [2025-03-03 15:14:46,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:14:46" (1/1) ... [2025-03-03 15:14:46,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:14:46,967 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33192,33205] [2025-03-03 15:14:47,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[47557,47570] [2025-03-03 15:14:47,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[54728,54741] [2025-03-03 15:14:47,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[58287,58300] [2025-03-03 15:14:47,043 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[61647,61660] [2025-03-03 15:14:47,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[76934,76947] [2025-03-03 15:14:47,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[84100,84113] [2025-03-03 15:14:47,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[87654,87667] [2025-03-03 15:14:47,103 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[91009,91022] [2025-03-03 15:14:47,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[95142,95155] [2025-03-03 15:14:47,115 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[98563,98576] [2025-03-03 15:14:47,122 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[102117,102130] [2025-03-03 15:14:47,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[105472,105485] [2025-03-03 15:14:47,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[109226,109239] [2025-03-03 15:14:47,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[112596,112609] [2025-03-03 15:14:47,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[116131,116144] [2025-03-03 15:14:47,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:14:47,192 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:14:47,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33192,33205] [2025-03-03 15:14:47,308 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[47557,47570] [2025-03-03 15:14:47,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[54728,54741] [2025-03-03 15:14:47,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[58287,58300] [2025-03-03 15:14:47,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[61647,61660] [2025-03-03 15:14:47,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[76934,76947] [2025-03-03 15:14:47,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[84100,84113] [2025-03-03 15:14:47,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[87654,87667] [2025-03-03 15:14:47,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[91009,91022] [2025-03-03 15:14:47,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[95142,95155] [2025-03-03 15:14:47,377 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[98563,98576] [2025-03-03 15:14:47,382 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[102117,102130] [2025-03-03 15:14:47,386 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[105472,105485] [2025-03-03 15:14:47,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[109226,109239] [2025-03-03 15:14:47,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[112596,112609] [2025-03-03 15:14:47,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[116131,116144] [2025-03-03 15:14:47,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:14:47,432 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:14:47,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:47 WrapperNode [2025-03-03 15:14:47,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:14:47,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:14:47,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:14:47,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:14:47,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:47" (1/1) ... [2025-03-03 15:14:47,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:47" (1/1) ... [2025-03-03 15:14:47,558 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 5786 [2025-03-03 15:14:47,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:14:47,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:14:47,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:14:47,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:14:47,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:47" (1/1) ... [2025-03-03 15:14:47,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:47" (1/1) ... [2025-03-03 15:14:47,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:47" (1/1) ... [2025-03-03 15:14:47,627 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:14:47,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:47" (1/1) ... [2025-03-03 15:14:47,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:47" (1/1) ... [2025-03-03 15:14:47,674 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:47" (1/1) ... [2025-03-03 15:14:47,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:47" (1/1) ... [2025-03-03 15:14:47,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:47" (1/1) ... [2025-03-03 15:14:47,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:47" (1/1) ... [2025-03-03 15:14:47,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:14:47,748 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:14:47,748 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:14:47,748 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:14:47,749 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:47" (1/1) ... [2025-03-03 15:14:47,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:14:47,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:14:47,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:14:47,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:14:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:14:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:14:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:14:47,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:14:47,964 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:14:47,965 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:14:50,270 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4463: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~24#1;havoc main_~node5__m5~22#1;havoc main_~node4__m4~18#1;havoc main_~node3__m3~16#1;havoc main_~node2__m2~15#1;havoc main_~node1__m1~15#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~23#1; [2025-03-03 15:14:50,270 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4729: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~26#1;havoc main_~node5__m5~23#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~17#1;havoc main_~node2__m2~16#1;havoc main_~node1__m1~16#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~25#1; [2025-03-03 15:14:50,270 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2751: havoc main_~node5__m5~13#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~10#1;havoc main_~node2__m2~9#1;havoc main_~node1__m1~9#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~12#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2622: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~12#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4869: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~18#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L246: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7381: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1;havoc main_~node5__m5~37#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~28#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~25#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7780: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~39#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5669: havoc main_~check__tmp~32#1;havoc main_~node5__m5~28#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~19#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~31#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6068: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~25#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7658: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1;havoc main_~node5__m5~38#1;havoc main_~node4__m4~32#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~26#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9509: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1318: havoc main_~check__tmp~4#1;havoc main_~node5__m5~5#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5943: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~34#1;havoc main_~node5__m5~29#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~20#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~33#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4886: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~20#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8323: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~35#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9381: havoc main_~node3__m3~36#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1454: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~5#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6085: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~30#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3050: havoc main_~check__tmp~14#1;havoc main_~node5__m5~14#1;havoc main_~node4__m4~12#1;havoc main_~node3__m3~11#1;havoc main_~node2__m2~10#1;havoc main_~node1__m1~10#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~13#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3183: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~15#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7940: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1;havoc main_~node5__m5~40#1;havoc main_~node4__m4~33#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~27#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8206: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1;havoc main_~node5__m5~41#1;havoc main_~node4__m4~34#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~28#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2025-03-03 15:14:50,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4903: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-03-03 15:14:50,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1600: havoc main_~node5__m5~7#1;havoc main_~node4__m4~6#1;havoc main_~node3__m3~5#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~5#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~5#1; [2025-03-03 15:14:50,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-03 15:14:50,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8340: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~42#1; [2025-03-03 15:14:50,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1471: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~6#1; [2025-03-03 15:14:50,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9537: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:14:50,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8881: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~45#1; [2025-03-03 15:14:50,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6635: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~33#1; [2025-03-03 15:14:50,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6239: havoc main_~check__tmp~36#1;havoc main_~node5__m5~31#1;havoc main_~node4__m4~26#1;havoc main_~node3__m3~23#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~21#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~35#1; [2025-03-03 15:14:50,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9413: havoc main_~node4__m4~40#1; [2025-03-03 15:14:50,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L297: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-03 15:14:50,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3337: havoc main_~check__tmp~16#1;havoc main_~node5__m5~16#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~12#1;havoc main_~node2__m2~11#1;havoc main_~node1__m1~11#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~15#1; [2025-03-03 15:14:50,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3736: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~15#1; [2025-03-03 15:14:50,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6513: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1;havoc main_~node5__m5~32#1;havoc main_~node4__m4~27#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~22#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1; [2025-03-03 15:14:50,273 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5064: havoc main_~check__tmp~28#1;havoc main_~node5__m5~25#1;havoc main_~node4__m4~21#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~17#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~27#1; [2025-03-03 15:14:50,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3611: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~18#1;havoc main_~node5__m5~17#1;havoc main_~node4__m4~14#1;havoc main_~node3__m3~13#1;havoc main_~node2__m2~12#1;havoc main_~node1__m1~12#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~17#1; [2025-03-03 15:14:50,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8500: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1;havoc main_~node5__m5~43#1;havoc main_~node4__m4~36#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~29#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-03-03 15:14:50,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7181: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~27#1; [2025-03-03 15:14:50,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8767: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1;havoc main_~node5__m5~44#1;havoc main_~node4__m4~37#1;havoc main_~node3__m3~33#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~30#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1; [2025-03-03 15:14:50,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899: havoc main_~check__tmp~7#1;havoc main_~node5__m5~8#1;havoc main_~node4__m4~7#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~6#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~6#1; [2025-03-03 15:14:50,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-03 15:14:50,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2032: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~9#1; [2025-03-03 15:14:50,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9565: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:14:50,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L448: havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:14:50,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3753: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~18#1; [2025-03-03 15:14:50,275 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6795: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1;havoc main_~node5__m5~34#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~24#1;havoc main_~node1__m1~23#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1; [2025-03-03 15:14:50,275 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9307: havoc main_~node1__m1~33#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1;havoc main_~node5__m5~47#1;havoc main_~node4__m4~39#1;havoc main_~node3__m3~35#1;havoc main_~node2__m2~33#1;havoc main_~node1__m1~32#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1; [2025-03-03 15:14:50,275 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7061: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1;havoc main_~node5__m5~35#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~26#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~24#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2025-03-03 15:14:50,275 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9044: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1;havoc main_~node5__m5~46#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~34#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~31#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1; [2025-03-03 15:14:50,275 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7198: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~30#1; [2025-03-03 15:14:50,275 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L726: havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:14:50,275 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2186: havoc main_~check__tmp~9#1;havoc main_~node5__m5~10#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~7#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~8#1; [2025-03-03 15:14:50,275 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4303: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~21#1; [2025-03-03 15:14:50,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3907: havoc main_~check__tmp~20#1;havoc main_~node5__m5~19#1;havoc main_~node4__m4~16#1;havoc main_~node3__m3~14#1;havoc main_~node2__m2~13#1;havoc main_~node1__m1~13#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~19#1; [2025-03-03 15:14:50,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~9#1; [2025-03-03 15:14:50,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7215: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~36#1; [2025-03-03 15:14:50,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9594: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:14:50,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2460: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~11#1;havoc main_~node5__m5~11#1;havoc main_~node4__m4~9#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~10#1; [2025-03-03 15:14:50,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4181: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~22#1;havoc main_~node5__m5~20#1;havoc main_~node4__m4~17#1;havoc main_~node3__m3~15#1;havoc main_~node2__m2~14#1;havoc main_~node1__m1~14#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~21#1; [2025-03-03 15:14:50,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2605: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-03 15:14:50,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4852: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~17#1; [2025-03-03 15:14:50,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5382: havoc main_~check__tmp~30#1;havoc main_~node5__m5~26#1;havoc main_~node4__m4~22#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~18#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~29#1; [2025-03-03 15:14:50,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L890: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~3#1; [2025-03-03 15:14:50,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5515: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~27#1; [2025-03-03 15:14:50,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024: havoc main_~node5__m5~4#1;havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:14:50,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9349: havoc main_~node2__m2~34#1; [2025-03-03 15:14:50,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9481: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~48#1; [2025-03-03 15:14:50,450 INFO L? ?]: Removed 1024 outVars from TransFormulas that were not future-live. [2025-03-03 15:14:50,450 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:14:50,484 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:14:50,484 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:14:50,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:14:50 BoogieIcfgContainer [2025-03-03 15:14:50,485 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:14:50,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:14:50,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:14:50,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:14:50,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:14:46" (1/3) ... [2025-03-03 15:14:50,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d31890c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:14:50, skipping insertion in model container [2025-03-03 15:14:50,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:47" (2/3) ... [2025-03-03 15:14:50,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d31890c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:14:50, skipping insertion in model container [2025-03-03 15:14:50,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:14:50" (3/3) ... [2025-03-03 15:14:50,491 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-03 15:14:50,500 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:14:50,502 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 1111 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-03-03 15:14:50,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:14:50,575 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;@5d795b8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:14:50,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-03 15:14:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 1111 states, 1094 states have (on average 1.8272394881170018) internal successors, (1999), 1110 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:14:50,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:50,595 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-03-03 15:14:50,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:14:50,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1374374570, now seen corresponding path program 1 times [2025-03-03 15:14:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:50,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123720721] [2025-03-03 15:14:50,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:50,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:50,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:14:50,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:14:50,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:50,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:51,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123720721] [2025-03-03 15:14:51,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123720721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:51,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:51,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:14:51,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485839066] [2025-03-03 15:14:51,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:51,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:14:51,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:51,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:14:51,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:14:51,088 INFO L87 Difference]: Start difference. First operand has 1111 states, 1094 states have (on average 1.8272394881170018) internal successors, (1999), 1110 states have internal predecessors, (1999), 0 states have call successors, (0), 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 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:51,709 INFO L93 Difference]: Finished difference Result 1257 states and 2216 transitions. [2025-03-03 15:14:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:14:51,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-03-03 15:14:51,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:51,723 INFO L225 Difference]: With dead ends: 1257 [2025-03-03 15:14:51,723 INFO L226 Difference]: Without dead ends: 700 [2025-03-03 15:14:51,727 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-03-03 15:14:51,728 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 3554 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3554 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:51,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3554 Valid, 775 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:14:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-03-03 15:14:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2025-03-03 15:14:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 684 states have (on average 1.293859649122807) internal successors, (885), 699 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 885 transitions. [2025-03-03 15:14:51,778 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 885 transitions. Word has length 72 [2025-03-03 15:14:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:51,778 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 885 transitions. [2025-03-03 15:14:51,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 885 transitions. [2025-03-03 15:14:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:14:51,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:51,781 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-03-03 15:14:51,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:14:51,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:14:51,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash -556221686, now seen corresponding path program 1 times [2025-03-03 15:14:51,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:51,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663891905] [2025-03-03 15:14:51,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:51,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:51,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:14:51,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:14:51,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:51,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:51,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:51,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663891905] [2025-03-03 15:14:51,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663891905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:51,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:51,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:14:51,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777382456] [2025-03-03 15:14:51,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:51,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:14:51,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:51,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:14:51,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:14:51,956 INFO L87 Difference]: Start difference. First operand 700 states and 885 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:52,429 INFO L93 Difference]: Finished difference Result 1206 states and 1558 transitions. [2025-03-03 15:14:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:14:52,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-03-03 15:14:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:52,432 INFO L225 Difference]: With dead ends: 1206 [2025-03-03 15:14:52,432 INFO L226 Difference]: Without dead ends: 836 [2025-03-03 15:14:52,433 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-03-03 15:14:52,433 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 2858 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2858 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:52,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2858 Valid, 570 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:14:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-03 15:14:52,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 770. [2025-03-03 15:14:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 754 states have (on average 1.3660477453580901) internal successors, (1030), 769 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1030 transitions. [2025-03-03 15:14:52,457 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1030 transitions. Word has length 72 [2025-03-03 15:14:52,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:52,457 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1030 transitions. [2025-03-03 15:14:52,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1030 transitions. [2025-03-03 15:14:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:14:52,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:52,460 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-03-03 15:14:52,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:14:52,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:14:52,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:52,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2039915490, now seen corresponding path program 1 times [2025-03-03 15:14:52,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:52,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246970234] [2025-03-03 15:14:52,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:52,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:52,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:14:52,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:14:52,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:52,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:52,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:52,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246970234] [2025-03-03 15:14:52,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246970234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:52,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:52,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:14:52,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323061499] [2025-03-03 15:14:52,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:52,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:14:52,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:52,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:14:52,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:14:52,623 INFO L87 Difference]: Start difference. First operand 770 states and 1030 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:52,905 INFO L93 Difference]: Finished difference Result 1078 states and 1453 transitions. [2025-03-03 15:14:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:14:52,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-03-03 15:14:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:52,907 INFO L225 Difference]: With dead ends: 1078 [2025-03-03 15:14:52,908 INFO L226 Difference]: Without dead ends: 653 [2025-03-03 15:14:52,908 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-03-03 15:14:52,911 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 1795 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1795 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:52,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1795 Valid, 340 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:14:52,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-03 15:14:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2025-03-03 15:14:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 637 states have (on average 1.3861852433281006) internal successors, (883), 652 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 883 transitions. [2025-03-03 15:14:52,927 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 883 transitions. Word has length 72 [2025-03-03 15:14:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:52,927 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 883 transitions. [2025-03-03 15:14:52,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 883 transitions. [2025-03-03 15:14:52,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:14:52,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:52,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] [2025-03-03 15:14:52,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:14:52,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:14:52,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:52,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1882388166, now seen corresponding path program 1 times [2025-03-03 15:14:52,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:52,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499915450] [2025-03-03 15:14:52,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:52,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:52,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:14:52,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:14:52,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:52,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:53,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:53,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499915450] [2025-03-03 15:14:53,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499915450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:53,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:53,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:14:53,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211571906] [2025-03-03 15:14:53,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:53,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:14:53,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:53,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:14:53,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:14:53,053 INFO L87 Difference]: Start difference. First operand 653 states and 883 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 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-03-03 15:14:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:53,246 INFO L93 Difference]: Finished difference Result 917 states and 1242 transitions. [2025-03-03 15:14:53,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:14:53,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 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-03-03 15:14:53,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:53,248 INFO L225 Difference]: With dead ends: 917 [2025-03-03 15:14:53,248 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 15:14:53,249 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-03-03 15:14:53,249 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 1478 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:53,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 308 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:14:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 15:14:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 15:14:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 1.3962616822429907) internal successors, (747), 550 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 747 transitions. [2025-03-03 15:14:53,258 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 747 transitions. Word has length 73 [2025-03-03 15:14:53,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:53,258 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 747 transitions. [2025-03-03 15:14:53,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 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-03-03 15:14:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 747 transitions. [2025-03-03 15:14:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:14:53,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:53,258 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] [2025-03-03 15:14:53,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:14:53,259 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:14:53,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash 286689312, now seen corresponding path program 1 times [2025-03-03 15:14:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:53,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126660882] [2025-03-03 15:14:53,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:53,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:53,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:14:53,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:14:53,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:53,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:53,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:53,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126660882] [2025-03-03 15:14:53,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126660882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:53,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:53,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:14:53,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695490330] [2025-03-03 15:14:53,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:53,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:14:53,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:53,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:14:53,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:14:53,388 INFO L87 Difference]: Start difference. First operand 551 states and 747 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:53,617 INFO L93 Difference]: Finished difference Result 825 states and 1125 transitions. [2025-03-03 15:14:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:14:53,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-03 15:14:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:53,619 INFO L225 Difference]: With dead ends: 825 [2025-03-03 15:14:53,619 INFO L226 Difference]: Without dead ends: 543 [2025-03-03 15:14:53,619 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-03-03 15:14:53,620 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 1414 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:53,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 281 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:14:53,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-03 15:14:53,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2025-03-03 15:14:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.396584440227704) internal successors, (736), 542 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 736 transitions. [2025-03-03 15:14:53,633 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 736 transitions. Word has length 74 [2025-03-03 15:14:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:53,633 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 736 transitions. [2025-03-03 15:14:53,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 736 transitions. [2025-03-03 15:14:53,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:14:53,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:53,634 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] [2025-03-03 15:14:53,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:14:53,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:14:53,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:53,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1296343751, now seen corresponding path program 1 times [2025-03-03 15:14:53,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:53,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668043052] [2025-03-03 15:14:53,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:53,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:53,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:14:53,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:14:53,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:53,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:53,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:53,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668043052] [2025-03-03 15:14:53,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668043052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:53,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:53,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:53,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822693643] [2025-03-03 15:14:53,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:53,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:14:53,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:53,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:14:53,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:14:53,964 INFO L87 Difference]: Start difference. First operand 543 states and 736 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:54,442 INFO L93 Difference]: Finished difference Result 1045 states and 1398 transitions. [2025-03-03 15:14:54,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:14:54,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 15:14:54,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:54,447 INFO L225 Difference]: With dead ends: 1045 [2025-03-03 15:14:54,447 INFO L226 Difference]: Without dead ends: 771 [2025-03-03 15:14:54,448 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-03-03 15:14:54,449 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 1606 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:54,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 1023 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:14:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-03-03 15:14:54,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 543. [2025-03-03 15:14:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.394686907020873) internal successors, (735), 542 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-03-03 15:14:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 735 transitions. [2025-03-03 15:14:54,460 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 735 transitions. Word has length 75 [2025-03-03 15:14:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:54,460 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 735 transitions. [2025-03-03 15:14:54,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 735 transitions. [2025-03-03 15:14:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:14:54,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:54,461 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] [2025-03-03 15:14:54,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:14:54,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:14:54,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:54,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1445156994, now seen corresponding path program 1 times [2025-03-03 15:14:54,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:54,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491974246] [2025-03-03 15:14:54,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:54,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:54,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:14:54,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:14:54,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:54,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:54,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:54,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491974246] [2025-03-03 15:14:54,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491974246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:54,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:54,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:14:54,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34821926] [2025-03-03 15:14:54,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:54,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:14:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:54,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:14:54,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:14:54,735 INFO L87 Difference]: Start difference. First operand 543 states and 735 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:55,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:55,376 INFO L93 Difference]: Finished difference Result 866 states and 1205 transitions. [2025-03-03 15:14:55,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:14:55,376 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 15:14:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:55,378 INFO L225 Difference]: With dead ends: 866 [2025-03-03 15:14:55,378 INFO L226 Difference]: Without dead ends: 676 [2025-03-03 15:14:55,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:14:55,379 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 1268 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:55,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 1879 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:14:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-03 15:14:55,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 543. [2025-03-03 15:14:55,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3927893738140418) internal successors, (734), 542 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 734 transitions. [2025-03-03 15:14:55,388 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 734 transitions. Word has length 75 [2025-03-03 15:14:55,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:55,388 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 734 transitions. [2025-03-03 15:14:55,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 734 transitions. [2025-03-03 15:14:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:14:55,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:55,389 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] [2025-03-03 15:14:55,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:14:55,389 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:14:55,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1347341980, now seen corresponding path program 1 times [2025-03-03 15:14:55,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:55,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241938341] [2025-03-03 15:14:55,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:55,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:55,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:14:55,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:14:55,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:55,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:55,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:55,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241938341] [2025-03-03 15:14:55,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241938341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:55,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:55,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:14:55,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783402002] [2025-03-03 15:14:55,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:55,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:14:55,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:55,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:14:55,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:14:55,664 INFO L87 Difference]: Start difference. First operand 543 states and 734 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:56,262 INFO L93 Difference]: Finished difference Result 1021 states and 1410 transitions. [2025-03-03 15:14:56,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:14:56,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 15:14:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:56,265 INFO L225 Difference]: With dead ends: 1021 [2025-03-03 15:14:56,265 INFO L226 Difference]: Without dead ends: 870 [2025-03-03 15:14:56,266 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-03-03 15:14:56,266 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 2226 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2226 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:56,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2226 Valid, 1785 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:14:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-03 15:14:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 543. [2025-03-03 15:14:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3908918406072106) internal successors, (733), 542 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 733 transitions. [2025-03-03 15:14:56,276 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 733 transitions. Word has length 75 [2025-03-03 15:14:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:56,276 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 733 transitions. [2025-03-03 15:14:56,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 733 transitions. [2025-03-03 15:14:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:14:56,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:56,277 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] [2025-03-03 15:14:56,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:14:56,277 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:14:56,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:56,277 INFO L85 PathProgramCache]: Analyzing trace with hash -560428487, now seen corresponding path program 1 times [2025-03-03 15:14:56,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:56,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243800277] [2025-03-03 15:14:56,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:56,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:56,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:14:56,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:14:56,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:56,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:56,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:56,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243800277] [2025-03-03 15:14:56,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243800277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:56,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:56,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:14:56,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411683839] [2025-03-03 15:14:56,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:56,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:14:56,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:56,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:14:56,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:14:56,597 INFO L87 Difference]: Start difference. First operand 543 states and 733 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:57,319 INFO L93 Difference]: Finished difference Result 1072 states and 1471 transitions. [2025-03-03 15:14:57,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:14:57,319 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-03 15:14:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:57,321 INFO L225 Difference]: With dead ends: 1072 [2025-03-03 15:14:57,321 INFO L226 Difference]: Without dead ends: 882 [2025-03-03 15:14:57,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:14:57,322 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 1951 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1951 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:57,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1951 Valid, 1924 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:14:57,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-03 15:14:57,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 549. [2025-03-03 15:14:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 533 states have (on average 1.3864915572232646) internal successors, (739), 548 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 739 transitions. [2025-03-03 15:14:57,331 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 739 transitions. Word has length 77 [2025-03-03 15:14:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:57,331 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 739 transitions. [2025-03-03 15:14:57,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 739 transitions. [2025-03-03 15:14:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:14:57,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:57,332 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] [2025-03-03 15:14:57,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:14:57,332 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:14:57,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:57,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2040574949, now seen corresponding path program 1 times [2025-03-03 15:14:57,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:57,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649582788] [2025-03-03 15:14:57,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:57,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:57,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:14:57,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:14:57,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:57,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:57,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:57,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649582788] [2025-03-03 15:14:57,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649582788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:57,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:57,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 15:14:57,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323030082] [2025-03-03 15:14:57,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:57,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:14:57,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:57,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:14:57,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:14:57,741 INFO L87 Difference]: Start difference. First operand 549 states and 739 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:58,508 INFO L93 Difference]: Finished difference Result 978 states and 1354 transitions. [2025-03-03 15:14:58,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:14:58,509 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-03 15:14:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:58,511 INFO L225 Difference]: With dead ends: 978 [2025-03-03 15:14:58,511 INFO L226 Difference]: Without dead ends: 722 [2025-03-03 15:14:58,511 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-03-03 15:14:58,512 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 1673 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:58,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 1916 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:14:58,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-03 15:14:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 543. [2025-03-03 15:14:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3870967741935485) internal successors, (731), 542 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-03-03 15:14:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 731 transitions. [2025-03-03 15:14:58,519 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 731 transitions. Word has length 77 [2025-03-03 15:14:58,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:58,519 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 731 transitions. [2025-03-03 15:14:58,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 731 transitions. [2025-03-03 15:14:58,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:14:58,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:58,520 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] [2025-03-03 15:14:58,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:14:58,521 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:14:58,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:58,521 INFO L85 PathProgramCache]: Analyzing trace with hash 175908129, now seen corresponding path program 1 times [2025-03-03 15:14:58,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:58,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111862691] [2025-03-03 15:14:58,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:58,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:58,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:14:58,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:14:58,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:58,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:58,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:58,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111862691] [2025-03-03 15:14:58,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111862691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:58,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:58,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:14:58,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321128581] [2025-03-03 15:14:58,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:58,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:14:58,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:58,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:14:58,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:14:58,773 INFO L87 Difference]: Start difference. First operand 543 states and 731 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:59,319 INFO L93 Difference]: Finished difference Result 990 states and 1356 transitions. [2025-03-03 15:14:59,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:14:59,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-03 15:14:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:59,322 INFO L225 Difference]: With dead ends: 990 [2025-03-03 15:14:59,322 INFO L226 Difference]: Without dead ends: 846 [2025-03-03 15:14:59,322 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-03-03 15:14:59,323 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 2724 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:59,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2724 Valid, 1291 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:14:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-03 15:14:59,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 543. [2025-03-03 15:14:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3833017077798861) internal successors, (729), 542 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 729 transitions. [2025-03-03 15:14:59,331 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 729 transitions. Word has length 77 [2025-03-03 15:14:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:59,331 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 729 transitions. [2025-03-03 15:14:59,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 729 transitions. [2025-03-03 15:14:59,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:14:59,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:59,332 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] [2025-03-03 15:14:59,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:14:59,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:14:59,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:59,333 INFO L85 PathProgramCache]: Analyzing trace with hash 798025463, now seen corresponding path program 1 times [2025-03-03 15:14:59,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:59,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084353180] [2025-03-03 15:14:59,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:59,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:59,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:14:59,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:14:59,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:59,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:59,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:59,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084353180] [2025-03-03 15:14:59,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084353180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:59,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:59,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:14:59,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557270052] [2025-03-03 15:14:59,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:59,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:14:59,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:59,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:14:59,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:14:59,527 INFO L87 Difference]: Start difference. First operand 543 states and 729 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:00,208 INFO L93 Difference]: Finished difference Result 1040 states and 1428 transitions. [2025-03-03 15:15:00,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:00,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-03 15:15:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:00,210 INFO L225 Difference]: With dead ends: 1040 [2025-03-03 15:15:00,210 INFO L226 Difference]: Without dead ends: 870 [2025-03-03 15:15:00,211 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-03-03 15:15:00,211 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 2034 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 2199 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:00,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2034 Valid, 2199 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:15:00,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-03 15:15:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 543. [2025-03-03 15:15:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3795066413662238) internal successors, (727), 542 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 727 transitions. [2025-03-03 15:15:00,219 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 727 transitions. Word has length 77 [2025-03-03 15:15:00,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:00,219 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 727 transitions. [2025-03-03 15:15:00,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 727 transitions. [2025-03-03 15:15:00,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:15:00,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:00,220 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] [2025-03-03 15:15:00,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:15:00,220 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:00,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:00,221 INFO L85 PathProgramCache]: Analyzing trace with hash 889581907, now seen corresponding path program 1 times [2025-03-03 15:15:00,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:00,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254122536] [2025-03-03 15:15:00,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:00,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:00,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:15:00,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:15:00,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:00,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:00,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:00,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254122536] [2025-03-03 15:15:00,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254122536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:00,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:00,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:00,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265331380] [2025-03-03 15:15:00,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:00,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:00,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:00,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:00,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:00,417 INFO L87 Difference]: Start difference. First operand 543 states and 727 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:01,026 INFO L93 Difference]: Finished difference Result 1030 states and 1412 transitions. [2025-03-03 15:15:01,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:15:01,026 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-03 15:15:01,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:01,028 INFO L225 Difference]: With dead ends: 1030 [2025-03-03 15:15:01,028 INFO L226 Difference]: Without dead ends: 870 [2025-03-03 15:15:01,029 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-03-03 15:15:01,029 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 1998 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1998 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:01,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1998 Valid, 1853 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:15:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-03 15:15:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 543. [2025-03-03 15:15:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3776091081593929) internal successors, (726), 542 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 726 transitions. [2025-03-03 15:15:01,036 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 726 transitions. Word has length 77 [2025-03-03 15:15:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:01,036 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 726 transitions. [2025-03-03 15:15:01,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 726 transitions. [2025-03-03 15:15:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:15:01,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:01,037 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] [2025-03-03 15:15:01,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:15:01,037 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:01,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1136179180, now seen corresponding path program 1 times [2025-03-03 15:15:01,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:01,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584837335] [2025-03-03 15:15:01,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:01,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:15:01,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:15:01,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:01,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:01,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:01,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584837335] [2025-03-03 15:15:01,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584837335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:01,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:01,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:01,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304050795] [2025-03-03 15:15:01,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:01,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:01,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:01,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:01,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:01,242 INFO L87 Difference]: Start difference. First operand 543 states and 726 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:01,743 INFO L93 Difference]: Finished difference Result 984 states and 1343 transitions. [2025-03-03 15:15:01,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:01,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-03 15:15:01,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:01,745 INFO L225 Difference]: With dead ends: 984 [2025-03-03 15:15:01,745 INFO L226 Difference]: Without dead ends: 846 [2025-03-03 15:15:01,745 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-03-03 15:15:01,746 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 1684 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:01,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 1654 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-03 15:15:01,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 543. [2025-03-03 15:15:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3757115749525617) internal successors, (725), 542 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 725 transitions. [2025-03-03 15:15:01,753 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 725 transitions. Word has length 77 [2025-03-03 15:15:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:01,753 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 725 transitions. [2025-03-03 15:15:01,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 725 transitions. [2025-03-03 15:15:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:15:01,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:01,754 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] [2025-03-03 15:15:01,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:15:01,754 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:01,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:01,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1482585862, now seen corresponding path program 1 times [2025-03-03 15:15:01,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:01,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631378852] [2025-03-03 15:15:01,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:01,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:15:01,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:15:01,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:01,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:02,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:02,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631378852] [2025-03-03 15:15:02,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631378852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:02,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:02,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:15:02,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182064471] [2025-03-03 15:15:02,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:02,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:15:02,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:02,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:15:02,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:02,073 INFO L87 Difference]: Start difference. First operand 543 states and 725 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:02,923 INFO L93 Difference]: Finished difference Result 1384 states and 1933 transitions. [2025-03-03 15:15:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:15:02,923 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-03 15:15:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:02,925 INFO L225 Difference]: With dead ends: 1384 [2025-03-03 15:15:02,925 INFO L226 Difference]: Without dead ends: 1246 [2025-03-03 15:15:02,926 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-03-03 15:15:02,926 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 4909 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4909 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:02,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4909 Valid, 1596 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:15:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-03-03 15:15:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 547. [2025-03-03 15:15:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3728813559322033) internal successors, (729), 546 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 729 transitions. [2025-03-03 15:15:02,936 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 729 transitions. Word has length 77 [2025-03-03 15:15:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:02,936 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 729 transitions. [2025-03-03 15:15:02,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 729 transitions. [2025-03-03 15:15:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:15:02,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:02,937 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] [2025-03-03 15:15:02,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:15:02,937 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:02,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:02,938 INFO L85 PathProgramCache]: Analyzing trace with hash 648132248, now seen corresponding path program 1 times [2025-03-03 15:15:02,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:02,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237975634] [2025-03-03 15:15:02,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:02,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:02,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:15:02,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:15:02,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:02,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:03,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:03,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237975634] [2025-03-03 15:15:03,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237975634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:03,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:03,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:03,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483719218] [2025-03-03 15:15:03,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:03,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:03,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:03,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:03,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:03,085 INFO L87 Difference]: Start difference. First operand 547 states and 729 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:03,584 INFO L93 Difference]: Finished difference Result 954 states and 1291 transitions. [2025-03-03 15:15:03,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:15:03,585 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-03 15:15:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:03,587 INFO L225 Difference]: With dead ends: 954 [2025-03-03 15:15:03,587 INFO L226 Difference]: Without dead ends: 826 [2025-03-03 15:15:03,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:15:03,588 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 2630 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2630 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:03,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2630 Valid, 1229 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-03-03 15:15:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 547. [2025-03-03 15:15:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3709981167608287) internal successors, (728), 546 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 728 transitions. [2025-03-03 15:15:03,596 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 728 transitions. Word has length 77 [2025-03-03 15:15:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:03,596 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 728 transitions. [2025-03-03 15:15:03,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 728 transitions. [2025-03-03 15:15:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:15:03,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:03,597 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] [2025-03-03 15:15:03,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:15:03,598 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:03,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:03,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2114497927, now seen corresponding path program 1 times [2025-03-03 15:15:03,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:03,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339111050] [2025-03-03 15:15:03,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:03,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:03,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:15:03,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:15:03,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:03,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:03,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-03-03 15:15:03,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:03,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339111050] [2025-03-03 15:15:03,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339111050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:03,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:03,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:03,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340711977] [2025-03-03 15:15:03,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:03,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:03,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:03,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:03,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:03,744 INFO L87 Difference]: Start difference. First operand 547 states and 728 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:04,275 INFO L93 Difference]: Finished difference Result 984 states and 1339 transitions. [2025-03-03 15:15:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:15:04,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-03 15:15:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:04,277 INFO L225 Difference]: With dead ends: 984 [2025-03-03 15:15:04,277 INFO L226 Difference]: Without dead ends: 846 [2025-03-03 15:15:04,277 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-03-03 15:15:04,278 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 1813 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1813 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:04,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1813 Valid, 1476 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-03 15:15:04,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 543. [2025-03-03 15:15:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3719165085388993) internal successors, (723), 542 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 723 transitions. [2025-03-03 15:15:04,284 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 723 transitions. Word has length 78 [2025-03-03 15:15:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:04,284 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 723 transitions. [2025-03-03 15:15:04,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 723 transitions. [2025-03-03 15:15:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:04,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:04,285 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] [2025-03-03 15:15:04,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:15:04,285 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:04,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1269269000, now seen corresponding path program 1 times [2025-03-03 15:15:04,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:04,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135085310] [2025-03-03 15:15:04,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:04,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:04,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:04,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:04,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:04,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:04,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:04,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135085310] [2025-03-03 15:15:04,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135085310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:04,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:04,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:15:04,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619988885] [2025-03-03 15:15:04,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:04,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:15:04,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:04,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:15:04,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:04,563 INFO L87 Difference]: Start difference. First operand 543 states and 723 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:05,595 INFO L93 Difference]: Finished difference Result 1540 states and 2157 transitions. [2025-03-03 15:15:05,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:15:05,595 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:15:05,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:05,598 INFO L225 Difference]: With dead ends: 1540 [2025-03-03 15:15:05,600 INFO L226 Difference]: Without dead ends: 1350 [2025-03-03 15:15:05,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:15:05,601 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 2977 mSDsluCounter, 2380 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2977 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:05,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2977 Valid, 2896 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:15:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-03-03 15:15:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 551. [2025-03-03 15:15:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 1.3663551401869158) internal successors, (731), 550 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-03-03 15:15:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 731 transitions. [2025-03-03 15:15:05,608 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 731 transitions. Word has length 79 [2025-03-03 15:15:05,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:05,608 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 731 transitions. [2025-03-03 15:15:05,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 731 transitions. [2025-03-03 15:15:05,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:05,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:05,609 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] [2025-03-03 15:15:05,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:15:05,609 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:05,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:05,610 INFO L85 PathProgramCache]: Analyzing trace with hash -210877462, now seen corresponding path program 1 times [2025-03-03 15:15:05,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:05,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476218251] [2025-03-03 15:15:05,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:05,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:05,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:05,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:05,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:05,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:05,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:05,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476218251] [2025-03-03 15:15:05,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476218251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:05,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:05,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:05,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917682089] [2025-03-03 15:15:05,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:05,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:05,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:05,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:05,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:05,741 INFO L87 Difference]: Start difference. First operand 551 states and 731 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:06,190 INFO L93 Difference]: Finished difference Result 1004 states and 1362 transitions. [2025-03-03 15:15:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:06,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:15:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:06,193 INFO L225 Difference]: With dead ends: 1004 [2025-03-03 15:15:06,193 INFO L226 Difference]: Without dead ends: 854 [2025-03-03 15:15:06,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:15:06,194 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 2076 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2076 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:06,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2076 Valid, 1491 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-03-03 15:15:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 551. [2025-03-03 15:15:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 1.3626168224299064) internal successors, (729), 550 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 729 transitions. [2025-03-03 15:15:06,199 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 729 transitions. Word has length 79 [2025-03-03 15:15:06,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:06,199 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 729 transitions. [2025-03-03 15:15:06,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:06,200 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 729 transitions. [2025-03-03 15:15:06,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:06,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:06,200 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] [2025-03-03 15:15:06,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:15:06,201 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:06,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash -907101364, now seen corresponding path program 1 times [2025-03-03 15:15:06,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:06,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47006429] [2025-03-03 15:15:06,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:06,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:06,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:06,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:06,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:06,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:06,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:06,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47006429] [2025-03-03 15:15:06,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47006429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:06,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:06,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:06,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728012237] [2025-03-03 15:15:06,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:06,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:06,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:06,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:06,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:06,357 INFO L87 Difference]: Start difference. First operand 551 states and 729 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:06,817 INFO L93 Difference]: Finished difference Result 964 states and 1297 transitions. [2025-03-03 15:15:06,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:06,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:15:06,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:06,819 INFO L225 Difference]: With dead ends: 964 [2025-03-03 15:15:06,819 INFO L226 Difference]: Without dead ends: 830 [2025-03-03 15:15:06,820 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-03-03 15:15:06,820 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 2213 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:06,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 1609 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-03-03 15:15:06,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 551. [2025-03-03 15:15:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 1.3588785046728973) internal successors, (727), 550 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 727 transitions. [2025-03-03 15:15:06,825 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 727 transitions. Word has length 79 [2025-03-03 15:15:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:06,825 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 727 transitions. [2025-03-03 15:15:06,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 727 transitions. [2025-03-03 15:15:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:06,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:06,826 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] [2025-03-03 15:15:06,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:15:06,826 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:06,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:06,826 INFO L85 PathProgramCache]: Analyzing trace with hash 204131349, now seen corresponding path program 1 times [2025-03-03 15:15:06,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:06,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650538889] [2025-03-03 15:15:06,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:06,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:06,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:06,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:06,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:06,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:07,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:07,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650538889] [2025-03-03 15:15:07,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650538889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:07,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:07,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:15:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904964223] [2025-03-03 15:15:07,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:07,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:15:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:07,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:15:07,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:07,073 INFO L87 Difference]: Start difference. First operand 551 states and 727 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:07,834 INFO L93 Difference]: Finished difference Result 1271 states and 1748 transitions. [2025-03-03 15:15:07,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:15:07,834 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:15:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:07,837 INFO L225 Difference]: With dead ends: 1271 [2025-03-03 15:15:07,837 INFO L226 Difference]: Without dead ends: 1254 [2025-03-03 15:15:07,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:15:07,838 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 4905 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4905 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:07,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4905 Valid, 1760 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:15:07,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-03 15:15:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 559. [2025-03-03 15:15:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 543 states have (on average 1.3535911602209945) internal successors, (735), 558 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-03-03 15:15:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 735 transitions. [2025-03-03 15:15:07,846 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 735 transitions. Word has length 79 [2025-03-03 15:15:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:07,846 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 735 transitions. [2025-03-03 15:15:07,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 735 transitions. [2025-03-03 15:15:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:07,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:07,847 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] [2025-03-03 15:15:07,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:15:07,848 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:07,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:07,849 INFO L85 PathProgramCache]: Analyzing trace with hash -492092553, now seen corresponding path program 1 times [2025-03-03 15:15:07,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:07,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539194061] [2025-03-03 15:15:07,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:07,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:07,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:07,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:07,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:07,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:07,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-03-03 15:15:07,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:07,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539194061] [2025-03-03 15:15:07,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539194061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:07,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:07,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:07,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226119612] [2025-03-03 15:15:07,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:07,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:07,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:07,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:07,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:07,984 INFO L87 Difference]: Start difference. First operand 559 states and 735 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:08,423 INFO L93 Difference]: Finished difference Result 843 states and 1108 transitions. [2025-03-03 15:15:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:08,424 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:15:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:08,428 INFO L225 Difference]: With dead ends: 843 [2025-03-03 15:15:08,428 INFO L226 Difference]: Without dead ends: 838 [2025-03-03 15:15:08,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:15:08,430 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 1257 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:08,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 1316 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-03 15:15:08,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 559. [2025-03-03 15:15:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 543 states have (on average 1.3499079189686924) internal successors, (733), 558 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 733 transitions. [2025-03-03 15:15:08,438 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 733 transitions. Word has length 79 [2025-03-03 15:15:08,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:08,438 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 733 transitions. [2025-03-03 15:15:08,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 733 transitions. [2025-03-03 15:15:08,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:08,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:08,439 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] [2025-03-03 15:15:08,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:15:08,439 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:08,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1706807715, now seen corresponding path program 1 times [2025-03-03 15:15:08,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130234521] [2025-03-03 15:15:08,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:08,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:08,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:08,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:08,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:08,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:08,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130234521] [2025-03-03 15:15:08,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130234521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:08,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:08,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:08,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102125207] [2025-03-03 15:15:08,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:08,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:08,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:08,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:08,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:08,629 INFO L87 Difference]: Start difference. First operand 559 states and 733 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:09,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:09,105 INFO L93 Difference]: Finished difference Result 968 states and 1296 transitions. [2025-03-03 15:15:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:09,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:15:09,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:09,107 INFO L225 Difference]: With dead ends: 968 [2025-03-03 15:15:09,107 INFO L226 Difference]: Without dead ends: 838 [2025-03-03 15:15:09,107 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-03-03 15:15:09,108 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 2127 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2127 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:09,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2127 Valid, 1779 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-03 15:15:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 559. [2025-03-03 15:15:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 543 states have (on average 1.3462246777163904) internal successors, (731), 558 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-03-03 15:15:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 731 transitions. [2025-03-03 15:15:09,113 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 731 transitions. Word has length 79 [2025-03-03 15:15:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:09,113 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 731 transitions. [2025-03-03 15:15:09,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 731 transitions. [2025-03-03 15:15:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:09,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:09,114 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] [2025-03-03 15:15:09,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:15:09,114 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:09,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:09,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2036799118, now seen corresponding path program 1 times [2025-03-03 15:15:09,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:09,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898048557] [2025-03-03 15:15:09,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:09,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:09,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:09,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:09,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:09,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:09,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:09,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898048557] [2025-03-03 15:15:09,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898048557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:09,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:09,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:09,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379522897] [2025-03-03 15:15:09,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:09,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:09,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:09,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:09,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:09,242 INFO L87 Difference]: Start difference. First operand 559 states and 731 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:09,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:09,712 INFO L93 Difference]: Finished difference Result 843 states and 1104 transitions. [2025-03-03 15:15:09,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:15:09,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:15:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:09,714 INFO L225 Difference]: With dead ends: 843 [2025-03-03 15:15:09,714 INFO L226 Difference]: Without dead ends: 838 [2025-03-03 15:15:09,714 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-03-03 15:15:09,714 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1705 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:09,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 1455 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:09,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-03 15:15:09,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 559. [2025-03-03 15:15:09,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 543 states have (on average 1.3425414364640884) internal successors, (729), 558 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 729 transitions. [2025-03-03 15:15:09,720 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 729 transitions. Word has length 79 [2025-03-03 15:15:09,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:09,720 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 729 transitions. [2025-03-03 15:15:09,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:09,720 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 729 transitions. [2025-03-03 15:15:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:09,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:09,721 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] [2025-03-03 15:15:09,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:15:09,721 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:09,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:09,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1241546157, now seen corresponding path program 1 times [2025-03-03 15:15:09,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:09,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189865995] [2025-03-03 15:15:09,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:09,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:09,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:09,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:09,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:09,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:09,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:09,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189865995] [2025-03-03 15:15:09,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189865995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:09,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:09,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:09,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033694260] [2025-03-03 15:15:09,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:09,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:09,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:09,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:09,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:09,854 INFO L87 Difference]: Start difference. First operand 559 states and 729 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:10,279 INFO L93 Difference]: Finished difference Result 969 states and 1291 transitions. [2025-03-03 15:15:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:15:10,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:15:10,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:10,281 INFO L225 Difference]: With dead ends: 969 [2025-03-03 15:15:10,281 INFO L226 Difference]: Without dead ends: 838 [2025-03-03 15:15:10,281 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-03-03 15:15:10,282 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 1251 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:10,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 1301 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-03 15:15:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 559. [2025-03-03 15:15:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 543 states have (on average 1.3406998158379373) internal successors, (728), 558 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 728 transitions. [2025-03-03 15:15:10,287 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 728 transitions. Word has length 79 [2025-03-03 15:15:10,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:10,287 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 728 transitions. [2025-03-03 15:15:10,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:10,287 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 728 transitions. [2025-03-03 15:15:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:10,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:10,288 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] [2025-03-03 15:15:10,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:15:10,288 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:10,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:10,288 INFO L85 PathProgramCache]: Analyzing trace with hash -879359090, now seen corresponding path program 1 times [2025-03-03 15:15:10,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:10,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767845039] [2025-03-03 15:15:10,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:10,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:10,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:10,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:10,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:10,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:10,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:10,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767845039] [2025-03-03 15:15:10,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767845039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:10,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:10,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:10,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611357409] [2025-03-03 15:15:10,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:10,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:10,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:10,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:10,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:10,435 INFO L87 Difference]: Start difference. First operand 559 states and 728 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:10,882 INFO L93 Difference]: Finished difference Result 966 states and 1286 transitions. [2025-03-03 15:15:10,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:10,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:15:10,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:10,884 INFO L225 Difference]: With dead ends: 966 [2025-03-03 15:15:10,884 INFO L226 Difference]: Without dead ends: 838 [2025-03-03 15:15:10,885 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-03-03 15:15:10,885 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 2194 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2194 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:10,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2194 Valid, 1605 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-03 15:15:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 559. [2025-03-03 15:15:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 543 states have (on average 1.3388581952117864) internal successors, (727), 558 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 727 transitions. [2025-03-03 15:15:10,890 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 727 transitions. Word has length 79 [2025-03-03 15:15:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:10,890 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 727 transitions. [2025-03-03 15:15:10,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:10,891 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 727 transitions. [2025-03-03 15:15:10,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:10,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:10,891 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] [2025-03-03 15:15:10,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:15:10,891 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:10,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash 596264093, now seen corresponding path program 1 times [2025-03-03 15:15:10,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:10,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854532146] [2025-03-03 15:15:10,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:10,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:10,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:10,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:10,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:10,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:11,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:11,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854532146] [2025-03-03 15:15:11,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854532146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:11,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:11,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:11,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693808908] [2025-03-03 15:15:11,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:11,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:11,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:11,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:11,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:11,030 INFO L87 Difference]: Start difference. First operand 559 states and 727 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:11,454 INFO L93 Difference]: Finished difference Result 997 states and 1335 transitions. [2025-03-03 15:15:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:15:11,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:15:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:11,456 INFO L225 Difference]: With dead ends: 997 [2025-03-03 15:15:11,456 INFO L226 Difference]: Without dead ends: 854 [2025-03-03 15:15:11,458 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-03-03 15:15:11,458 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 1660 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1660 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:11,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1660 Valid, 1598 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:11,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-03-03 15:15:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 559. [2025-03-03 15:15:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 543 states have (on average 1.3370165745856353) internal successors, (726), 558 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 726 transitions. [2025-03-03 15:15:11,464 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 726 transitions. Word has length 79 [2025-03-03 15:15:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:11,464 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 726 transitions. [2025-03-03 15:15:11,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 726 transitions. [2025-03-03 15:15:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:11,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:11,465 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] [2025-03-03 15:15:11,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:15:11,465 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:11,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:11,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1124756673, now seen corresponding path program 1 times [2025-03-03 15:15:11,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:11,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404155418] [2025-03-03 15:15:11,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:11,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:11,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:11,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:11,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:11,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:11,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:11,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404155418] [2025-03-03 15:15:11,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404155418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:11,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:11,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:11,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813807737] [2025-03-03 15:15:11,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:11,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:11,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:11,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:11,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:11,618 INFO L87 Difference]: Start difference. First operand 559 states and 726 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:12,093 INFO L93 Difference]: Finished difference Result 969 states and 1287 transitions. [2025-03-03 15:15:12,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:12,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:15:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:12,096 INFO L225 Difference]: With dead ends: 969 [2025-03-03 15:15:12,096 INFO L226 Difference]: Without dead ends: 838 [2025-03-03 15:15:12,096 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-03-03 15:15:12,096 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 2164 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:12,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2164 Valid, 1661 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-03 15:15:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 559. [2025-03-03 15:15:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 543 states have (on average 1.3351749539594844) internal successors, (725), 558 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 725 transitions. [2025-03-03 15:15:12,101 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 725 transitions. Word has length 79 [2025-03-03 15:15:12,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:12,101 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 725 transitions. [2025-03-03 15:15:12,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 725 transitions. [2025-03-03 15:15:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:12,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:12,102 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] [2025-03-03 15:15:12,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:15:12,102 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:12,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash -765491245, now seen corresponding path program 1 times [2025-03-03 15:15:12,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:12,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331379830] [2025-03-03 15:15:12,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:12,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:12,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:12,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:12,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:12,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:12,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:12,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331379830] [2025-03-03 15:15:12,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331379830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:12,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:12,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:15:12,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012116906] [2025-03-03 15:15:12,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:12,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:15:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:12,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:15:12,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:12,454 INFO L87 Difference]: Start difference. First operand 559 states and 725 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:13,335 INFO L93 Difference]: Finished difference Result 1163 states and 1567 transitions. [2025-03-03 15:15:13,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:15:13,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:15:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:13,338 INFO L225 Difference]: With dead ends: 1163 [2025-03-03 15:15:13,338 INFO L226 Difference]: Without dead ends: 1158 [2025-03-03 15:15:13,338 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-03-03 15:15:13,339 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 3954 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3954 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:13,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3954 Valid, 1713 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:15:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-03-03 15:15:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 563. [2025-03-03 15:15:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 547 states have (on average 1.3327239488117002) internal successors, (729), 562 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 729 transitions. [2025-03-03 15:15:13,345 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 729 transitions. Word has length 79 [2025-03-03 15:15:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:13,345 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 729 transitions. [2025-03-03 15:15:13,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 729 transitions. [2025-03-03 15:15:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:13,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:13,346 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] [2025-03-03 15:15:13,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:15:13,346 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:13,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash -180085630, now seen corresponding path program 1 times [2025-03-03 15:15:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:13,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000332554] [2025-03-03 15:15:13,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:13,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:13,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:13,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:13,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:13,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:13,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:13,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000332554] [2025-03-03 15:15:13,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000332554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:13,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:13,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:13,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043022596] [2025-03-03 15:15:13,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:13,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:13,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:13,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:13,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:13,479 INFO L87 Difference]: Start difference. First operand 563 states and 729 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:13,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:13,856 INFO L93 Difference]: Finished difference Result 966 states and 1282 transitions. [2025-03-03 15:15:13,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:13,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:15:13,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:13,858 INFO L225 Difference]: With dead ends: 966 [2025-03-03 15:15:13,858 INFO L226 Difference]: Without dead ends: 838 [2025-03-03 15:15:13,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:15:13,859 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 1844 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1844 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:13,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1844 Valid, 1356 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-03 15:15:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 563. [2025-03-03 15:15:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 547 states have (on average 1.3308957952468008) internal successors, (728), 562 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 728 transitions. [2025-03-03 15:15:13,865 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 728 transitions. Word has length 79 [2025-03-03 15:15:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:13,865 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 728 transitions. [2025-03-03 15:15:13,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 728 transitions. [2025-03-03 15:15:13,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:15:13,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:13,865 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] [2025-03-03 15:15:13,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:15:13,865 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:13,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:13,866 INFO L85 PathProgramCache]: Analyzing trace with hash 744356243, now seen corresponding path program 1 times [2025-03-03 15:15:13,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:13,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022353648] [2025-03-03 15:15:13,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:13,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:15:13,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:15:13,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:13,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:14,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:14,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022353648] [2025-03-03 15:15:14,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022353648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:14,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:14,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:14,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532206296] [2025-03-03 15:15:14,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:14,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:14,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:14,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:14,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:14,013 INFO L87 Difference]: Start difference. First operand 563 states and 728 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:14,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:14,389 INFO L93 Difference]: Finished difference Result 996 states and 1328 transitions. [2025-03-03 15:15:14,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:14,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:15:14,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:14,392 INFO L225 Difference]: With dead ends: 996 [2025-03-03 15:15:14,392 INFO L226 Difference]: Without dead ends: 862 [2025-03-03 15:15:14,392 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-03-03 15:15:14,392 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 2102 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2102 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:14,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2102 Valid, 1449 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-03-03 15:15:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 563. [2025-03-03 15:15:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 547 states have (on average 1.3290676416819014) internal successors, (727), 562 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 727 transitions. [2025-03-03 15:15:14,397 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 727 transitions. Word has length 79 [2025-03-03 15:15:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:14,397 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 727 transitions. [2025-03-03 15:15:14,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 727 transitions. [2025-03-03 15:15:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:15:14,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:14,398 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] [2025-03-03 15:15:14,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:15:14,398 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:14,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:14,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1814676376, now seen corresponding path program 1 times [2025-03-03 15:15:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:14,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386161674] [2025-03-03 15:15:14,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:14,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:14,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:15:14,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:15:14,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:14,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:14,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:14,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386161674] [2025-03-03 15:15:14,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386161674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:14,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:14,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:14,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615025724] [2025-03-03 15:15:14,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:14,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:14,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:14,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:14,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:14,584 INFO L87 Difference]: Start difference. First operand 563 states and 727 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:15,005 INFO L93 Difference]: Finished difference Result 879 states and 1145 transitions. [2025-03-03 15:15:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:15:15,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-03 15:15:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:15,008 INFO L225 Difference]: With dead ends: 879 [2025-03-03 15:15:15,008 INFO L226 Difference]: Without dead ends: 862 [2025-03-03 15:15:15,008 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-03-03 15:15:15,008 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 1776 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:15,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1776 Valid, 1476 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-03-03 15:15:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 555. [2025-03-03 15:15:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 539 states have (on average 1.3302411873840445) internal successors, (717), 554 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 717 transitions. [2025-03-03 15:15:15,015 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 717 transitions. Word has length 80 [2025-03-03 15:15:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:15,015 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 717 transitions. [2025-03-03 15:15:15,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 717 transitions. [2025-03-03 15:15:15,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:15:15,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:15,016 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] [2025-03-03 15:15:15,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:15:15,016 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:15,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:15,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1590905352, now seen corresponding path program 1 times [2025-03-03 15:15:15,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:15,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490922622] [2025-03-03 15:15:15,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:15,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:15,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:15:15,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:15:15,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:15,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:15,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:15,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490922622] [2025-03-03 15:15:15,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490922622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:15,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:15,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:15,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917526956] [2025-03-03 15:15:15,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:15,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:15,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:15,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:15,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:15,160 INFO L87 Difference]: Start difference. First operand 555 states and 717 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:15,553 INFO L93 Difference]: Finished difference Result 1064 states and 1421 transitions. [2025-03-03 15:15:15,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:15:15,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-03 15:15:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:15,555 INFO L225 Difference]: With dead ends: 1064 [2025-03-03 15:15:15,555 INFO L226 Difference]: Without dead ends: 874 [2025-03-03 15:15:15,555 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-03-03 15:15:15,555 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 2011 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:15,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 1683 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-03 15:15:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 547. [2025-03-03 15:15:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3314500941619585) internal successors, (707), 546 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 707 transitions. [2025-03-03 15:15:15,560 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 707 transitions. Word has length 80 [2025-03-03 15:15:15,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:15,560 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 707 transitions. [2025-03-03 15:15:15,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 707 transitions. [2025-03-03 15:15:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:15:15,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:15,560 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] [2025-03-03 15:15:15,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:15:15,560 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:15,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:15,561 INFO L85 PathProgramCache]: Analyzing trace with hash 940900532, now seen corresponding path program 1 times [2025-03-03 15:15:15,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:15,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403539983] [2025-03-03 15:15:15,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:15,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:15,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:15:15,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:15:15,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:15,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:15,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:15,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403539983] [2025-03-03 15:15:15,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403539983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:15,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:15,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:15,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851699366] [2025-03-03 15:15:15,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:15,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:15,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:15,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:15,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:15,686 INFO L87 Difference]: Start difference. First operand 547 states and 707 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:16,096 INFO L93 Difference]: Finished difference Result 827 states and 1072 transitions. [2025-03-03 15:15:16,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:15:16,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-03 15:15:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:16,098 INFO L225 Difference]: With dead ends: 827 [2025-03-03 15:15:16,098 INFO L226 Difference]: Without dead ends: 822 [2025-03-03 15:15:16,098 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-03-03 15:15:16,098 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 1180 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:16,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1421 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-03-03 15:15:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 543. [2025-03-03 15:15:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3320683111954459) internal successors, (702), 542 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 702 transitions. [2025-03-03 15:15:16,103 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 702 transitions. Word has length 80 [2025-03-03 15:15:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:16,103 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 702 transitions. [2025-03-03 15:15:16,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 702 transitions. [2025-03-03 15:15:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:15:16,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:16,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:15:16,103 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:16,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:16,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1108865040, now seen corresponding path program 1 times [2025-03-03 15:15:16,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:16,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143557094] [2025-03-03 15:15:16,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:16,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:16,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:15:16,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:15:16,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:16,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:16,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143557094] [2025-03-03 15:15:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143557094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:16,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:16,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:16,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747249381] [2025-03-03 15:15:16,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:16,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:16,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:16,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:16,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:16,330 INFO L87 Difference]: Start difference. First operand 543 states and 702 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:16,738 INFO L93 Difference]: Finished difference Result 948 states and 1257 transitions. [2025-03-03 15:15:16,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:16,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-03 15:15:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:16,739 INFO L225 Difference]: With dead ends: 948 [2025-03-03 15:15:16,739 INFO L226 Difference]: Without dead ends: 821 [2025-03-03 15:15:16,739 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-03-03 15:15:16,740 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 1649 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1649 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:16,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1649 Valid, 1586 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:16,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-03-03 15:15:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 542. [2025-03-03 15:15:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3307984790874525) internal successors, (700), 541 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 700 transitions. [2025-03-03 15:15:16,744 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 700 transitions. Word has length 80 [2025-03-03 15:15:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:16,744 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 700 transitions. [2025-03-03 15:15:16,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 700 transitions. [2025-03-03 15:15:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:15:16,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:16,745 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] [2025-03-03 15:15:16,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:15:16,745 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:16,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:16,745 INFO L85 PathProgramCache]: Analyzing trace with hash 961250031, now seen corresponding path program 1 times [2025-03-03 15:15:16,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:16,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489704653] [2025-03-03 15:15:16,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:16,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:16,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:15:16,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:15:16,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:16,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:17,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:17,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489704653] [2025-03-03 15:15:17,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489704653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:17,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:17,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-03-03 15:15:17,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070303415] [2025-03-03 15:15:17,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:17,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 15:15:17,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:17,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 15:15:17,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2025-03-03 15:15:17,834 INFO L87 Difference]: Start difference. First operand 542 states and 700 transitions. Second operand has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:21,672 INFO L93 Difference]: Finished difference Result 1382 states and 1845 transitions. [2025-03-03 15:15:21,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 15:15:21,672 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 15:15:21,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:21,674 INFO L225 Difference]: With dead ends: 1382 [2025-03-03 15:15:21,674 INFO L226 Difference]: Without dead ends: 1252 [2025-03-03 15:15:21,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=434, Invalid=2322, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 15:15:21,675 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 3016 mSDsluCounter, 11582 mSDsCounter, 0 mSdLazyCounter, 7100 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3016 SdHoareTripleChecker+Valid, 12445 SdHoareTripleChecker+Invalid, 7122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:21,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3016 Valid, 12445 Invalid, 7122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7100 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 15:15:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-03-03 15:15:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 557. [2025-03-03 15:15:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 541 states have (on average 1.33271719038817) internal successors, (721), 556 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 721 transitions. [2025-03-03 15:15:21,680 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 721 transitions. Word has length 81 [2025-03-03 15:15:21,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:21,680 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 721 transitions. [2025-03-03 15:15:21,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 721 transitions. [2025-03-03 15:15:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:15:21,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:21,681 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] [2025-03-03 15:15:21,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:15:21,681 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:21,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:21,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1019772130, now seen corresponding path program 1 times [2025-03-03 15:15:21,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:21,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588145812] [2025-03-03 15:15:21,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:21,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:21,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:15:21,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:15:21,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:21,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:22,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:22,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588145812] [2025-03-03 15:15:22,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588145812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:22,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:22,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:15:22,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138775491] [2025-03-03 15:15:22,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:22,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:15:22,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:22,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:15:22,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:22,004 INFO L87 Difference]: Start difference. First operand 557 states and 721 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:22,440 INFO L93 Difference]: Finished difference Result 947 states and 1273 transitions. [2025-03-03 15:15:22,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:15:22,441 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 15:15:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:22,442 INFO L225 Difference]: With dead ends: 947 [2025-03-03 15:15:22,442 INFO L226 Difference]: Without dead ends: 767 [2025-03-03 15:15:22,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:15:22,442 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 1895 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 3556 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:22,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 3556 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2025-03-03 15:15:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 503. [2025-03-03 15:15:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 490 states have (on average 1.3265306122448979) internal successors, (650), 502 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 650 transitions. [2025-03-03 15:15:22,446 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 650 transitions. Word has length 81 [2025-03-03 15:15:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:22,446 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 650 transitions. [2025-03-03 15:15:22,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 650 transitions. [2025-03-03 15:15:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:15:22,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:22,447 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] [2025-03-03 15:15:22,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:15:22,447 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:22,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:22,447 INFO L85 PathProgramCache]: Analyzing trace with hash 411224557, now seen corresponding path program 1 times [2025-03-03 15:15:22,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:22,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111467111] [2025-03-03 15:15:22,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:22,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:22,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:15:22,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:15:22,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:22,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:23,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111467111] [2025-03-03 15:15:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111467111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:23,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:23,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 15:15:23,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171697829] [2025-03-03 15:15:23,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:23,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 15:15:23,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:23,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 15:15:23,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:15:23,295 INFO L87 Difference]: Start difference. First operand 503 states and 650 transitions. Second operand has 20 states, 20 states have (on average 4.05) internal successors, (81), 20 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:25,061 INFO L93 Difference]: Finished difference Result 1098 states and 1468 transitions. [2025-03-03 15:15:25,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 15:15:25,061 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 20 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 15:15:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:25,062 INFO L225 Difference]: With dead ends: 1098 [2025-03-03 15:15:25,062 INFO L226 Difference]: Without dead ends: 913 [2025-03-03 15:15:25,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 15:15:25,063 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 3052 mSDsluCounter, 6053 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3052 SdHoareTripleChecker+Valid, 6609 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:25,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3052 Valid, 6609 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2199 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:15:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-03 15:15:25,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 485. [2025-03-03 15:15:25,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 484 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 624 transitions. [2025-03-03 15:15:25,071 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 624 transitions. Word has length 81 [2025-03-03 15:15:25,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:25,071 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 624 transitions. [2025-03-03 15:15:25,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 20 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 624 transitions. [2025-03-03 15:15:25,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:15:25,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:25,072 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] [2025-03-03 15:15:25,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:15:25,073 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:25,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:25,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1551497303, now seen corresponding path program 1 times [2025-03-03 15:15:25,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:25,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424520083] [2025-03-03 15:15:25,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:25,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:25,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:15:25,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:15:25,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:25,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:26,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:26,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424520083] [2025-03-03 15:15:26,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424520083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:26,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:26,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2025-03-03 15:15:26,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888603963] [2025-03-03 15:15:26,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:26,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 15:15:26,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:26,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 15:15:26,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:15:26,561 INFO L87 Difference]: Start difference. First operand 485 states and 624 transitions. Second operand has 30 states, 30 states have (on average 2.7) internal successors, (81), 30 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:31,124 INFO L93 Difference]: Finished difference Result 1153 states and 1543 transitions. [2025-03-03 15:15:31,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 15:15:31,125 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7) internal successors, (81), 30 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 15:15:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:31,126 INFO L225 Difference]: With dead ends: 1153 [2025-03-03 15:15:31,126 INFO L226 Difference]: Without dead ends: 1026 [2025-03-03 15:15:31,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=523, Invalid=2557, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 15:15:31,127 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 2407 mSDsluCounter, 11445 mSDsCounter, 0 mSdLazyCounter, 7373 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2407 SdHoareTripleChecker+Valid, 12143 SdHoareTripleChecker+Invalid, 7391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 7373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:31,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2407 Valid, 12143 Invalid, 7391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 7373 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 15:15:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2025-03-03 15:15:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 500. [2025-03-03 15:15:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 487 states have (on average 1.320328542094456) internal successors, (643), 499 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 643 transitions. [2025-03-03 15:15:31,133 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 643 transitions. Word has length 81 [2025-03-03 15:15:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:31,134 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 643 transitions. [2025-03-03 15:15:31,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7) internal successors, (81), 30 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 643 transitions. [2025-03-03 15:15:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:15:31,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:31,135 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] [2025-03-03 15:15:31,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:15:31,135 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1830104714, now seen corresponding path program 1 times [2025-03-03 15:15:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:31,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698623148] [2025-03-03 15:15:31,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:31,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:31,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:15:31,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:15:31,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:31,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:31,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:31,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698623148] [2025-03-03 15:15:31,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698623148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:31,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:31,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:15:31,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568615863] [2025-03-03 15:15:31,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:31,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:15:31,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:31,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:15:31,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:15:31,404 INFO L87 Difference]: Start difference. First operand 500 states and 643 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:31,709 INFO L93 Difference]: Finished difference Result 797 states and 1064 transitions. [2025-03-03 15:15:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:15:31,709 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 15:15:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:31,710 INFO L225 Difference]: With dead ends: 797 [2025-03-03 15:15:31,710 INFO L226 Difference]: Without dead ends: 539 [2025-03-03 15:15:31,710 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-03-03 15:15:31,711 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 816 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:31,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1697 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-03 15:15:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 368. [2025-03-03 15:15:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 360 states have (on average 1.325) internal successors, (477), 367 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 477 transitions. [2025-03-03 15:15:31,714 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 477 transitions. Word has length 81 [2025-03-03 15:15:31,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:31,714 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 477 transitions. [2025-03-03 15:15:31,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 477 transitions. [2025-03-03 15:15:31,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:15:31,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:31,715 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] [2025-03-03 15:15:31,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:15:31,715 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:31,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:31,716 INFO L85 PathProgramCache]: Analyzing trace with hash 749468343, now seen corresponding path program 1 times [2025-03-03 15:15:31,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:31,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813709004] [2025-03-03 15:15:31,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:31,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:31,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:15:31,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:15:31,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:31,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:31,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:31,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813709004] [2025-03-03 15:15:31,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813709004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:31,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:31,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:15:31,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250228936] [2025-03-03 15:15:31,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:31,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:15:31,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:31,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:15:31,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:31,964 INFO L87 Difference]: Start difference. First operand 368 states and 477 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:32,490 INFO L93 Difference]: Finished difference Result 1155 states and 1610 transitions. [2025-03-03 15:15:32,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:15:32,490 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-03 15:15:32,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:32,492 INFO L225 Difference]: With dead ends: 1155 [2025-03-03 15:15:32,492 INFO L226 Difference]: Without dead ends: 999 [2025-03-03 15:15:32,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:15:32,493 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 3650 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3650 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:32,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3650 Valid, 1063 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:32,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2025-03-03 15:15:32,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 376. [2025-03-03 15:15:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 368 states have (on average 1.315217391304348) internal successors, (484), 375 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 484 transitions. [2025-03-03 15:15:32,497 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 484 transitions. Word has length 82 [2025-03-03 15:15:32,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:32,497 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 484 transitions. [2025-03-03 15:15:32,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,497 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 484 transitions. [2025-03-03 15:15:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:15:32,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:32,497 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] [2025-03-03 15:15:32,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 15:15:32,497 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:32,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:32,498 INFO L85 PathProgramCache]: Analyzing trace with hash 410914649, now seen corresponding path program 1 times [2025-03-03 15:15:32,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:32,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044587290] [2025-03-03 15:15:32,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:32,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:15:32,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:15:32,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:32,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:32,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:32,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044587290] [2025-03-03 15:15:32,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044587290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:32,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:32,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:32,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473793077] [2025-03-03 15:15:32,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:32,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:32,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:32,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:32,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:32,650 INFO L87 Difference]: Start difference. First operand 376 states and 484 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:32,924 INFO L93 Difference]: Finished difference Result 576 states and 754 transitions. [2025-03-03 15:15:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:32,924 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-03 15:15:32,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:32,925 INFO L225 Difference]: With dead ends: 576 [2025-03-03 15:15:32,925 INFO L226 Difference]: Without dead ends: 569 [2025-03-03 15:15:32,926 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-03-03 15:15:32,926 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1299 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:32,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 984 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-03 15:15:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 376. [2025-03-03 15:15:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 368 states have (on average 1.3070652173913044) internal successors, (481), 375 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 481 transitions. [2025-03-03 15:15:32,929 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 481 transitions. Word has length 82 [2025-03-03 15:15:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:32,929 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 481 transitions. [2025-03-03 15:15:32,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 481 transitions. [2025-03-03 15:15:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:15:32,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:32,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] [2025-03-03 15:15:32,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 15:15:32,929 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:32,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1736418794, now seen corresponding path program 1 times [2025-03-03 15:15:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:32,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646380673] [2025-03-03 15:15:32,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:32,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:15:32,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:15:32,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:32,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:33,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:33,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646380673] [2025-03-03 15:15:33,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646380673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:33,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:33,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:15:33,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105236755] [2025-03-03 15:15:33,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:33,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:15:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:33,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:15:33,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:33,215 INFO L87 Difference]: Start difference. First operand 376 states and 481 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:33,545 INFO L93 Difference]: Finished difference Result 691 states and 931 transitions. [2025-03-03 15:15:33,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:33,546 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-03 15:15:33,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:33,546 INFO L225 Difference]: With dead ends: 691 [2025-03-03 15:15:33,546 INFO L226 Difference]: Without dead ends: 559 [2025-03-03 15:15:33,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:15:33,547 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 1349 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:33,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 1331 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:33,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-03 15:15:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 351. [2025-03-03 15:15:33,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 344 states have (on average 1.302325581395349) internal successors, (448), 350 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 448 transitions. [2025-03-03 15:15:33,550 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 448 transitions. Word has length 82 [2025-03-03 15:15:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:33,550 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 448 transitions. [2025-03-03 15:15:33,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 448 transitions. [2025-03-03 15:15:33,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:15:33,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:33,551 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] [2025-03-03 15:15:33,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 15:15:33,551 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:33,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:33,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1662218624, now seen corresponding path program 1 times [2025-03-03 15:15:33,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:33,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873695637] [2025-03-03 15:15:33,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:33,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:33,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:15:33,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:15:33,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:33,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:33,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:33,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873695637] [2025-03-03 15:15:33,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873695637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:33,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:33,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:15:33,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887495421] [2025-03-03 15:15:33,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:33,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:15:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:33,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:15:33,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:33,829 INFO L87 Difference]: Start difference. First operand 351 states and 448 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:34,287 INFO L93 Difference]: Finished difference Result 536 states and 705 transitions. [2025-03-03 15:15:34,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:15:34,287 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-03 15:15:34,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:34,288 INFO L225 Difference]: With dead ends: 536 [2025-03-03 15:15:34,288 INFO L226 Difference]: Without dead ends: 532 [2025-03-03 15:15:34,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:15:34,289 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 1533 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:34,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 1548 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-03 15:15:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 347. [2025-03-03 15:15:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 341 states have (on average 1.3020527859237536) internal successors, (444), 346 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 444 transitions. [2025-03-03 15:15:34,291 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 444 transitions. Word has length 82 [2025-03-03 15:15:34,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:34,291 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 444 transitions. [2025-03-03 15:15:34,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 444 transitions. [2025-03-03 15:15:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:15:34,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:34,292 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] [2025-03-03 15:15:34,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 15:15:34,292 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:34,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:34,292 INFO L85 PathProgramCache]: Analyzing trace with hash -129113613, now seen corresponding path program 1 times [2025-03-03 15:15:34,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:34,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80673426] [2025-03-03 15:15:34,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:34,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:34,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:15:34,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:15:34,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:34,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:34,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:34,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80673426] [2025-03-03 15:15:34,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80673426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:34,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:34,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:15:34,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922819766] [2025-03-03 15:15:34,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:34,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:15:34,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:34,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:15:34,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:34,631 INFO L87 Difference]: Start difference. First operand 347 states and 444 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:35,121 INFO L93 Difference]: Finished difference Result 1024 states and 1402 transitions. [2025-03-03 15:15:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:15:35,122 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-03 15:15:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:35,123 INFO L225 Difference]: With dead ends: 1024 [2025-03-03 15:15:35,123 INFO L226 Difference]: Without dead ends: 882 [2025-03-03 15:15:35,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:15:35,124 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 1726 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 2639 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:35,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1726 Valid, 2639 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:35,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-03 15:15:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 325. [2025-03-03 15:15:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.3) internal successors, (416), 324 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:35,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 416 transitions. [2025-03-03 15:15:35,127 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 416 transitions. Word has length 82 [2025-03-03 15:15:35,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:35,127 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 416 transitions. [2025-03-03 15:15:35,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 416 transitions. [2025-03-03 15:15:35,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:15:35,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:35,128 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] [2025-03-03 15:15:35,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 15:15:35,128 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:35,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1645688421, now seen corresponding path program 1 times [2025-03-03 15:15:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:35,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809769022] [2025-03-03 15:15:35,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:35,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:15:35,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:15:35,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:35,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:35,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:35,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809769022] [2025-03-03 15:15:35,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809769022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:35,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:35,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:15:35,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822800322] [2025-03-03 15:15:35,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:35,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:15:35,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:35,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:15:35,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:35,360 INFO L87 Difference]: Start difference. First operand 325 states and 416 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:35,508 INFO L93 Difference]: Finished difference Result 451 states and 606 transitions. [2025-03-03 15:15:35,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:35,508 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-03 15:15:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:35,509 INFO L225 Difference]: With dead ends: 451 [2025-03-03 15:15:35,509 INFO L226 Difference]: Without dead ends: 273 [2025-03-03 15:15:35,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:15:35,509 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 256 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:35,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 845 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:35,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-03 15:15:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-03-03 15:15:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 270 states have (on average 1.3074074074074074) internal successors, (353), 272 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 353 transitions. [2025-03-03 15:15:35,512 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 353 transitions. Word has length 82 [2025-03-03 15:15:35,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:35,512 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 353 transitions. [2025-03-03 15:15:35,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 353 transitions. [2025-03-03 15:15:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 15:15:35,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:35,513 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] [2025-03-03 15:15:35,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 15:15:35,513 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:35,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash -990103780, now seen corresponding path program 1 times [2025-03-03 15:15:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:35,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791205729] [2025-03-03 15:15:35,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:35,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:35,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:15:35,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:15:35,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:35,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:35,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:35,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791205729] [2025-03-03 15:15:35,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791205729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:35,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:35,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:35,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626852999] [2025-03-03 15:15:35,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:35,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:35,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:35,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:35,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:35,630 INFO L87 Difference]: Start difference. First operand 273 states and 353 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:35,878 INFO L93 Difference]: Finished difference Result 607 states and 829 transitions. [2025-03-03 15:15:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:15:35,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-03 15:15:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:35,879 INFO L225 Difference]: With dead ends: 607 [2025-03-03 15:15:35,879 INFO L226 Difference]: Without dead ends: 451 [2025-03-03 15:15:35,880 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-03-03 15:15:35,880 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 575 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:35,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 842 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:15:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-03-03 15:15:35,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 265. [2025-03-03 15:15:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 262 states have (on average 1.3091603053435115) internal successors, (343), 264 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2025-03-03 15:15:35,882 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 83 [2025-03-03 15:15:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:35,882 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2025-03-03 15:15:35,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:35,882 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2025-03-03 15:15:35,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 15:15:35,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:35,883 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] [2025-03-03 15:15:35,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 15:15:35,883 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:35,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash 594222774, now seen corresponding path program 1 times [2025-03-03 15:15:35,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:35,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763759529] [2025-03-03 15:15:35,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:35,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:35,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 15:15:35,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 15:15:35,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:35,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:36,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:36,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763759529] [2025-03-03 15:15:36,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763759529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:36,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:36,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:15:36,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133297803] [2025-03-03 15:15:36,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:36,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:15:36,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:36,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:15:36,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:36,171 INFO L87 Difference]: Start difference. First operand 265 states and 343 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:36,469 INFO L93 Difference]: Finished difference Result 417 states and 565 transitions. [2025-03-03 15:15:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:15:36,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-03 15:15:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:36,470 INFO L225 Difference]: With dead ends: 417 [2025-03-03 15:15:36,470 INFO L226 Difference]: Without dead ends: 411 [2025-03-03 15:15:36,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:15:36,471 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 741 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:36,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1341 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:36,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-03 15:15:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 259. [2025-03-03 15:15:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 257 states have (on average 1.3073929961089494) internal successors, (336), 258 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 336 transitions. [2025-03-03 15:15:36,476 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 336 transitions. Word has length 84 [2025-03-03 15:15:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:36,476 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 336 transitions. [2025-03-03 15:15:36,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 336 transitions. [2025-03-03 15:15:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 15:15:36,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:36,476 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] [2025-03-03 15:15:36,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 15:15:36,476 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:36,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:36,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1712355241, now seen corresponding path program 1 times [2025-03-03 15:15:36,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:36,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761363438] [2025-03-03 15:15:36,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:36,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:36,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 15:15:36,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 15:15:36,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:36,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:37,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:37,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761363438] [2025-03-03 15:15:37,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761363438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:37,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:37,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-03-03 15:15:37,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815635983] [2025-03-03 15:15:37,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:37,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 15:15:37,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:37,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 15:15:37,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:15:37,517 INFO L87 Difference]: Start difference. First operand 259 states and 336 transitions. Second operand has 28 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:39,050 INFO L93 Difference]: Finished difference Result 435 states and 583 transitions. [2025-03-03 15:15:39,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 15:15:39,051 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-03 15:15:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:39,051 INFO L225 Difference]: With dead ends: 435 [2025-03-03 15:15:39,051 INFO L226 Difference]: Without dead ends: 427 [2025-03-03 15:15:39,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=425, Invalid=2125, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 15:15:39,052 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 681 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 3532 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:39,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 3532 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:15:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-03 15:15:39,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 273. [2025-03-03 15:15:39,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 271 states have (on average 1.3025830258302582) internal successors, (353), 272 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 353 transitions. [2025-03-03 15:15:39,055 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 353 transitions. Word has length 84 [2025-03-03 15:15:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:39,055 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 353 transitions. [2025-03-03 15:15:39,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 353 transitions. [2025-03-03 15:15:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:15:39,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:39,055 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] [2025-03-03 15:15:39,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-03 15:15:39,055 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:39,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1277245900, now seen corresponding path program 1 times [2025-03-03 15:15:39,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:39,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816046422] [2025-03-03 15:15:39,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:39,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:39,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:15:39,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:15:39,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:39,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:39,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816046422] [2025-03-03 15:15:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816046422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:39,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:39,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:15:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014818088] [2025-03-03 15:15:39,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:39,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:15:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:39,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:15:39,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:39,351 INFO L87 Difference]: Start difference. First operand 273 states and 353 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:39,623 INFO L93 Difference]: Finished difference Result 437 states and 589 transitions. [2025-03-03 15:15:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:15:39,623 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:15:39,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:39,624 INFO L225 Difference]: With dead ends: 437 [2025-03-03 15:15:39,624 INFO L226 Difference]: Without dead ends: 422 [2025-03-03 15:15:39,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:15:39,624 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 838 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:39,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1470 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:39,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-03 15:15:39,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 247. [2025-03-03 15:15:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.3089430894308942) internal successors, (322), 246 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 322 transitions. [2025-03-03 15:15:39,626 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 322 transitions. Word has length 85 [2025-03-03 15:15:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:39,626 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 322 transitions. [2025-03-03 15:15:39,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 322 transitions. [2025-03-03 15:15:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:15:39,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:39,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:39,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-03 15:15:39,627 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:39,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:39,627 INFO L85 PathProgramCache]: Analyzing trace with hash 208015276, now seen corresponding path program 1 times [2025-03-03 15:15:39,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:39,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785042395] [2025-03-03 15:15:39,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:39,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:39,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:15:39,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:15:39,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:39,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:39,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:39,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785042395] [2025-03-03 15:15:39,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785042395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:39,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:39,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:39,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078722053] [2025-03-03 15:15:39,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:39,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:39,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:39,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:39,717 INFO L87 Difference]: Start difference. First operand 247 states and 322 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:39,817 INFO L93 Difference]: Finished difference Result 1507 states and 2222 transitions. [2025-03-03 15:15:39,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 15:15:39,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-03 15:15:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:39,819 INFO L225 Difference]: With dead ends: 1507 [2025-03-03 15:15:39,819 INFO L226 Difference]: Without dead ends: 1381 [2025-03-03 15:15:39,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:15:39,820 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 1257 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:39,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 1856 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-03-03 15:15:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 371. [2025-03-03 15:15:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.3702702702702703) internal successors, (507), 370 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 507 transitions. [2025-03-03 15:15:39,825 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 507 transitions. Word has length 111 [2025-03-03 15:15:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:39,825 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 507 transitions. [2025-03-03 15:15:39,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 507 transitions. [2025-03-03 15:15:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 15:15:39,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:39,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:39,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 15:15:39,826 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:39,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:39,826 INFO L85 PathProgramCache]: Analyzing trace with hash 248156968, now seen corresponding path program 1 times [2025-03-03 15:15:39,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:39,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796997714] [2025-03-03 15:15:39,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:39,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:39,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 15:15:39,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 15:15:39,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:39,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:39,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:39,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796997714] [2025-03-03 15:15:39,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796997714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:39,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:39,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:39,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417942920] [2025-03-03 15:15:39,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:39,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:39,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:39,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:39,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:39,909 INFO L87 Difference]: Start difference. First operand 371 states and 507 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:39,978 INFO L93 Difference]: Finished difference Result 1747 states and 2568 transitions. [2025-03-03 15:15:39,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:15:39,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-03 15:15:39,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:39,980 INFO L225 Difference]: With dead ends: 1747 [2025-03-03 15:15:39,980 INFO L226 Difference]: Without dead ends: 1497 [2025-03-03 15:15:39,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:15:39,981 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 955 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:39,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 1177 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-03-03 15:15:39,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 619. [2025-03-03 15:15:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 618 states have (on average 1.4223300970873787) internal successors, (879), 618 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 879 transitions. [2025-03-03 15:15:39,988 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 879 transitions. Word has length 113 [2025-03-03 15:15:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:39,988 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 879 transitions. [2025-03-03 15:15:39,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:39,988 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 879 transitions. [2025-03-03 15:15:39,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 15:15:39,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:39,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:39,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-03 15:15:39,988 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:39,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:39,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1840525992, now seen corresponding path program 1 times [2025-03-03 15:15:39,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:39,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353323941] [2025-03-03 15:15:39,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:39,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:40,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 15:15:40,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 15:15:40,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:40,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:40,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:40,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353323941] [2025-03-03 15:15:40,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353323941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:40,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:40,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:40,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704683556] [2025-03-03 15:15:40,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:40,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:40,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:40,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:40,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:40,072 INFO L87 Difference]: Start difference. First operand 619 states and 879 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:40,142 INFO L93 Difference]: Finished difference Result 1995 states and 2940 transitions. [2025-03-03 15:15:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:15:40,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-03 15:15:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:40,145 INFO L225 Difference]: With dead ends: 1995 [2025-03-03 15:15:40,145 INFO L226 Difference]: Without dead ends: 1745 [2025-03-03 15:15:40,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:15:40,146 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 996 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:40,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 1073 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2025-03-03 15:15:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 991. [2025-03-03 15:15:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.4505050505050505) internal successors, (1436), 990 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1436 transitions. [2025-03-03 15:15:40,154 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1436 transitions. Word has length 113 [2025-03-03 15:15:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:40,154 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1436 transitions. [2025-03-03 15:15:40,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1436 transitions. [2025-03-03 15:15:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 15:15:40,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:40,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:40,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-03 15:15:40,155 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:40,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:40,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1892880936, now seen corresponding path program 1 times [2025-03-03 15:15:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:40,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908089333] [2025-03-03 15:15:40,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:40,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:40,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 15:15:40,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 15:15:40,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:40,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:40,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:40,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908089333] [2025-03-03 15:15:40,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908089333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:40,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:40,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:40,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214125533] [2025-03-03 15:15:40,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:40,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:40,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:40,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:40,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:40,246 INFO L87 Difference]: Start difference. First operand 991 states and 1436 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:40,328 INFO L93 Difference]: Finished difference Result 2243 states and 3312 transitions. [2025-03-03 15:15:40,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:15:40,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-03 15:15:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:40,332 INFO L225 Difference]: With dead ends: 2243 [2025-03-03 15:15:40,332 INFO L226 Difference]: Without dead ends: 1993 [2025-03-03 15:15:40,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:15:40,333 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 1050 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:40,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 1091 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:40,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2025-03-03 15:15:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1239. [2025-03-03 15:15:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4604200323101777) internal successors, (1808), 1238 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1808 transitions. [2025-03-03 15:15:40,344 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1808 transitions. Word has length 113 [2025-03-03 15:15:40,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:40,344 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1808 transitions. [2025-03-03 15:15:40,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1808 transitions. [2025-03-03 15:15:40,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 15:15:40,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:40,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:40,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-03 15:15:40,345 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:40,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:40,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1451312728, now seen corresponding path program 1 times [2025-03-03 15:15:40,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:40,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466511251] [2025-03-03 15:15:40,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:40,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:40,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 15:15:40,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 15:15:40,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:40,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:40,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:40,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466511251] [2025-03-03 15:15:40,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466511251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:40,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:40,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:40,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602574666] [2025-03-03 15:15:40,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:40,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:40,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:40,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:40,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:40,433 INFO L87 Difference]: Start difference. First operand 1239 states and 1808 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:40,523 INFO L93 Difference]: Finished difference Result 2491 states and 3684 transitions. [2025-03-03 15:15:40,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:15:40,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-03 15:15:40,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:40,526 INFO L225 Difference]: With dead ends: 2491 [2025-03-03 15:15:40,526 INFO L226 Difference]: Without dead ends: 2241 [2025-03-03 15:15:40,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:15:40,527 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 979 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:40,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 1175 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:15:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2025-03-03 15:15:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 1487. [2025-03-03 15:15:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1486 states have (on average 1.4670255720053835) internal successors, (2180), 1486 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2180 transitions. [2025-03-03 15:15:40,542 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2180 transitions. Word has length 113 [2025-03-03 15:15:40,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:40,542 INFO L471 AbstractCegarLoop]: Abstraction has 1487 states and 2180 transitions. [2025-03-03 15:15:40,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2180 transitions. [2025-03-03 15:15:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 15:15:40,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:40,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:40,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-03 15:15:40,543 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:40,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:40,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1951821052, now seen corresponding path program 1 times [2025-03-03 15:15:40,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:40,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990687713] [2025-03-03 15:15:40,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:40,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:40,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 15:15:40,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 15:15:40,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:40,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:40,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:40,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990687713] [2025-03-03 15:15:40,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990687713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:40,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:40,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:40,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867133506] [2025-03-03 15:15:40,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:40,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:40,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:40,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:40,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:40,589 INFO L87 Difference]: Start difference. First operand 1487 states and 2180 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:40,607 INFO L93 Difference]: Finished difference Result 4077 states and 6026 transitions. [2025-03-03 15:15:40,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:40,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-03 15:15:40,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:40,611 INFO L225 Difference]: With dead ends: 4077 [2025-03-03 15:15:40,611 INFO L226 Difference]: Without dead ends: 2711 [2025-03-03 15:15:40,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:40,612 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 111 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:40,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 308 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:40,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2025-03-03 15:15:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2687. [2025-03-03 15:15:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 2686 states have (on average 1.4516008935219658) internal successors, (3899), 2686 states have internal predecessors, (3899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3899 transitions. [2025-03-03 15:15:40,631 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3899 transitions. Word has length 113 [2025-03-03 15:15:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:40,631 INFO L471 AbstractCegarLoop]: Abstraction has 2687 states and 3899 transitions. [2025-03-03 15:15:40,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3899 transitions. [2025-03-03 15:15:40,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 15:15:40,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:40,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:40,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-03 15:15:40,632 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:40,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:40,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1916727254, now seen corresponding path program 1 times [2025-03-03 15:15:40,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:40,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733065243] [2025-03-03 15:15:40,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:40,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:40,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 15:15:40,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 15:15:40,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:40,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:40,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:40,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733065243] [2025-03-03 15:15:40,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733065243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:40,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:40,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:40,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950072131] [2025-03-03 15:15:40,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:40,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:40,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:40,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:40,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:40,765 INFO L87 Difference]: Start difference. First operand 2687 states and 3899 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:40,850 INFO L93 Difference]: Finished difference Result 5255 states and 7667 transitions. [2025-03-03 15:15:40,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:15:40,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-03 15:15:40,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:40,853 INFO L225 Difference]: With dead ends: 5255 [2025-03-03 15:15:40,853 INFO L226 Difference]: Without dead ends: 2689 [2025-03-03 15:15:40,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:15:40,855 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 100 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:40,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 647 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:40,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2025-03-03 15:15:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2687. [2025-03-03 15:15:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 2686 states have (on average 1.447133283693224) internal successors, (3887), 2686 states have internal predecessors, (3887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3887 transitions. [2025-03-03 15:15:40,873 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3887 transitions. Word has length 113 [2025-03-03 15:15:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:40,873 INFO L471 AbstractCegarLoop]: Abstraction has 2687 states and 3887 transitions. [2025-03-03 15:15:40,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3887 transitions. [2025-03-03 15:15:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:15:40,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:40,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:40,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-03 15:15:40,875 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:40,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash 704120033, now seen corresponding path program 1 times [2025-03-03 15:15:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:40,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705526394] [2025-03-03 15:15:40,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:40,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:40,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:15:40,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:15:40,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:40,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:40,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:40,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705526394] [2025-03-03 15:15:40,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705526394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:40,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:40,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:40,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599012726] [2025-03-03 15:15:40,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:40,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:40,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:40,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:40,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:40,941 INFO L87 Difference]: Start difference. First operand 2687 states and 3887 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:40,976 INFO L93 Difference]: Finished difference Result 7643 states and 11089 transitions. [2025-03-03 15:15:40,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:40,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-03-03 15:15:40,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:40,981 INFO L225 Difference]: With dead ends: 7643 [2025-03-03 15:15:40,981 INFO L226 Difference]: Without dead ends: 5077 [2025-03-03 15:15:40,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:40,984 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 90 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 407 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-03-03 15:15:40,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5077 states. [2025-03-03 15:15:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5077 to 4899. [2025-03-03 15:15:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4899 states, 4898 states have (on average 1.4432421396488362) internal successors, (7069), 4898 states have internal predecessors, (7069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4899 states to 4899 states and 7069 transitions. [2025-03-03 15:15:41,023 INFO L78 Accepts]: Start accepts. Automaton has 4899 states and 7069 transitions. Word has length 114 [2025-03-03 15:15:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:41,023 INFO L471 AbstractCegarLoop]: Abstraction has 4899 states and 7069 transitions. [2025-03-03 15:15:41,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4899 states and 7069 transitions. [2025-03-03 15:15:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 15:15:41,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:41,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:41,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-03 15:15:41,024 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:41,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash -976895441, now seen corresponding path program 1 times [2025-03-03 15:15:41,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:41,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552345038] [2025-03-03 15:15:41,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:41,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 15:15:41,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 15:15:41,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:41,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:41,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:41,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552345038] [2025-03-03 15:15:41,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552345038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:41,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:41,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:41,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506926786] [2025-03-03 15:15:41,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:41,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:41,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:41,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:41,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:41,094 INFO L87 Difference]: Start difference. First operand 4899 states and 7069 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:41,123 INFO L93 Difference]: Finished difference Result 14103 states and 20327 transitions. [2025-03-03 15:15:41,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:41,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-03 15:15:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:41,131 INFO L225 Difference]: With dead ends: 14103 [2025-03-03 15:15:41,131 INFO L226 Difference]: Without dead ends: 9325 [2025-03-03 15:15:41,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:41,137 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 83 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 407 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-03-03 15:15:41,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:41,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9325 states. [2025-03-03 15:15:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9325 to 8971. [2025-03-03 15:15:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8971 states, 8970 states have (on average 1.4337792642140468) internal successors, (12861), 8970 states have internal predecessors, (12861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8971 states to 8971 states and 12861 transitions. [2025-03-03 15:15:41,216 INFO L78 Accepts]: Start accepts. Automaton has 8971 states and 12861 transitions. Word has length 115 [2025-03-03 15:15:41,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:41,216 INFO L471 AbstractCegarLoop]: Abstraction has 8971 states and 12861 transitions. [2025-03-03 15:15:41,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12861 transitions. [2025-03-03 15:15:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 15:15:41,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:41,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:41,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-03 15:15:41,218 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:41,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:41,221 INFO L85 PathProgramCache]: Analyzing trace with hash -548061907, now seen corresponding path program 1 times [2025-03-03 15:15:41,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:41,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868751738] [2025-03-03 15:15:41,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:41,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:41,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:15:41,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:15:41,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:41,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:41,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:41,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868751738] [2025-03-03 15:15:41,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868751738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:41,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:41,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:41,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294955774] [2025-03-03 15:15:41,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:41,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:41,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:41,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:41,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:41,302 INFO L87 Difference]: Start difference. First operand 8971 states and 12861 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:41,350 INFO L93 Difference]: Finished difference Result 25967 states and 37087 transitions. [2025-03-03 15:15:41,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:41,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-03 15:15:41,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:41,366 INFO L225 Difference]: With dead ends: 25967 [2025-03-03 15:15:41,366 INFO L226 Difference]: Without dead ends: 17117 [2025-03-03 15:15:41,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:41,378 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 76 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 407 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-03-03 15:15:41,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17117 states. [2025-03-03 15:15:41,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17117 to 16411. [2025-03-03 15:15:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16411 states, 16410 states have (on average 1.419926873857404) internal successors, (23301), 16410 states have internal predecessors, (23301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16411 states to 16411 states and 23301 transitions. [2025-03-03 15:15:41,575 INFO L78 Accepts]: Start accepts. Automaton has 16411 states and 23301 transitions. Word has length 116 [2025-03-03 15:15:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:41,575 INFO L471 AbstractCegarLoop]: Abstraction has 16411 states and 23301 transitions. [2025-03-03 15:15:41,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 16411 states and 23301 transitions. [2025-03-03 15:15:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 15:15:41,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:41,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:41,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-03 15:15:41,577 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:41,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:41,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2011179397, now seen corresponding path program 1 times [2025-03-03 15:15:41,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:41,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156836576] [2025-03-03 15:15:41,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:41,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:41,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 15:15:41,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 15:15:41,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:41,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:41,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:41,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156836576] [2025-03-03 15:15:41,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156836576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:41,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:41,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:41,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872176513] [2025-03-03 15:15:41,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:41,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:41,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:41,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:41,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:41,653 INFO L87 Difference]: Start difference. First operand 16411 states and 23301 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:41,726 INFO L93 Difference]: Finished difference Result 47583 states and 67175 transitions. [2025-03-03 15:15:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:41,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-03-03 15:15:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:41,757 INFO L225 Difference]: With dead ends: 47583 [2025-03-03 15:15:41,757 INFO L226 Difference]: Without dead ends: 31293 [2025-03-03 15:15:41,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:41,776 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 66 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 407 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-03-03 15:15:41,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 407 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:41,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31293 states. [2025-03-03 15:15:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31293 to 29883. [2025-03-03 15:15:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29883 states, 29882 states have (on average 1.4019476607991432) internal successors, (41893), 29882 states have internal predecessors, (41893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29883 states to 29883 states and 41893 transitions. [2025-03-03 15:15:42,135 INFO L78 Accepts]: Start accepts. Automaton has 29883 states and 41893 transitions. Word has length 117 [2025-03-03 15:15:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:42,135 INFO L471 AbstractCegarLoop]: Abstraction has 29883 states and 41893 transitions. [2025-03-03 15:15:42,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 29883 states and 41893 transitions. [2025-03-03 15:15:42,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 15:15:42,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:42,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:42,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-03 15:15:42,136 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:42,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:42,137 INFO L85 PathProgramCache]: Analyzing trace with hash -931301414, now seen corresponding path program 1 times [2025-03-03 15:15:42,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:42,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223874986] [2025-03-03 15:15:42,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:42,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:42,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 15:15:42,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 15:15:42,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:42,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:42,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:42,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223874986] [2025-03-03 15:15:42,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223874986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:42,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:42,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:15:42,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857463404] [2025-03-03 15:15:42,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:42,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:15:42,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:42,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:15:42,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:15:42,351 INFO L87 Difference]: Start difference. First operand 29883 states and 41893 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:42,416 INFO L93 Difference]: Finished difference Result 30845 states and 43174 transitions. [2025-03-03 15:15:42,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:15:42,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-03 15:15:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:42,448 INFO L225 Difference]: With dead ends: 30845 [2025-03-03 15:15:42,448 INFO L226 Difference]: Without dead ends: 30843 [2025-03-03 15:15:42,458 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-03-03 15:15:42,459 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:42,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 929 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30843 states. [2025-03-03 15:15:42,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30843 to 30843. [2025-03-03 15:15:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30843 states, 30842 states have (on average 1.383211205498995) internal successors, (42661), 30842 states have internal predecessors, (42661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30843 states to 30843 states and 42661 transitions. [2025-03-03 15:15:42,845 INFO L78 Accepts]: Start accepts. Automaton has 30843 states and 42661 transitions. Word has length 118 [2025-03-03 15:15:42,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:42,845 INFO L471 AbstractCegarLoop]: Abstraction has 30843 states and 42661 transitions. [2025-03-03 15:15:42,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:42,845 INFO L276 IsEmpty]: Start isEmpty. Operand 30843 states and 42661 transitions. [2025-03-03 15:15:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 15:15:42,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:42,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:42,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-03 15:15:42,846 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:42,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:42,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1438871329, now seen corresponding path program 1 times [2025-03-03 15:15:42,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:42,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584709553] [2025-03-03 15:15:42,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:42,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 15:15:42,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 15:15:42,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:42,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:42,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:42,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584709553] [2025-03-03 15:15:42,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584709553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:42,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:42,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:42,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545896504] [2025-03-03 15:15:42,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:42,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:15:42,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:42,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:15:42,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:42,936 INFO L87 Difference]: Start difference. First operand 30843 states and 42661 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:43,092 INFO L93 Difference]: Finished difference Result 58855 states and 81707 transitions. [2025-03-03 15:15:43,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:15:43,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-03 15:15:43,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:43,225 INFO L225 Difference]: With dead ends: 58855 [2025-03-03 15:15:43,225 INFO L226 Difference]: Without dead ends: 53253 [2025-03-03 15:15:43,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:15:43,235 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 979 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:43,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 1305 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:43,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53253 states. [2025-03-03 15:15:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53253 to 36443. [2025-03-03 15:15:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36443 states, 36442 states have (on average 1.3831567971022447) internal successors, (50405), 36442 states have internal predecessors, (50405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:43,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36443 states to 36443 states and 50405 transitions. [2025-03-03 15:15:43,726 INFO L78 Accepts]: Start accepts. Automaton has 36443 states and 50405 transitions. Word has length 118 [2025-03-03 15:15:43,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:43,727 INFO L471 AbstractCegarLoop]: Abstraction has 36443 states and 50405 transitions. [2025-03-03 15:15:43,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 36443 states and 50405 transitions. [2025-03-03 15:15:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 15:15:43,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:43,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:43,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-03 15:15:43,728 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:43,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:43,728 INFO L85 PathProgramCache]: Analyzing trace with hash 145017134, now seen corresponding path program 1 times [2025-03-03 15:15:43,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:43,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981807487] [2025-03-03 15:15:43,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:43,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 15:15:43,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 15:15:43,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:43,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:43,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:43,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981807487] [2025-03-03 15:15:43,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981807487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:43,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:43,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:43,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257924170] [2025-03-03 15:15:43,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:43,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:43,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:43,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:43,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:43,838 INFO L87 Difference]: Start difference. First operand 36443 states and 50405 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:44,002 INFO L93 Difference]: Finished difference Result 94527 states and 130535 transitions. [2025-03-03 15:15:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:44,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-03 15:15:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:44,067 INFO L225 Difference]: With dead ends: 94527 [2025-03-03 15:15:44,067 INFO L226 Difference]: Without dead ends: 58205 [2025-03-03 15:15:44,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:44,102 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 94 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 410 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-03-03 15:15:44,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 410 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:44,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58205 states. [2025-03-03 15:15:44,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58205 to 54875. [2025-03-03 15:15:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54875 states, 54874 states have (on average 1.364088639428509) internal successors, (74853), 54874 states have internal predecessors, (74853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54875 states to 54875 states and 74853 transitions. [2025-03-03 15:15:44,918 INFO L78 Accepts]: Start accepts. Automaton has 54875 states and 74853 transitions. Word has length 119 [2025-03-03 15:15:44,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:44,918 INFO L471 AbstractCegarLoop]: Abstraction has 54875 states and 74853 transitions. [2025-03-03 15:15:44,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 54875 states and 74853 transitions. [2025-03-03 15:15:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 15:15:44,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:44,924 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:44,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-03 15:15:44,924 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:44,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:44,924 INFO L85 PathProgramCache]: Analyzing trace with hash 330631624, now seen corresponding path program 1 times [2025-03-03 15:15:44,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:44,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245409210] [2025-03-03 15:15:44,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:44,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:44,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 15:15:44,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 15:15:44,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:44,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:44,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:44,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245409210] [2025-03-03 15:15:44,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245409210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:44,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:44,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:44,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041724744] [2025-03-03 15:15:44,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:44,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:44,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:44,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:44,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:44,990 INFO L87 Difference]: Start difference. First operand 54875 states and 74853 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:45,188 INFO L93 Difference]: Finished difference Result 109631 states and 149575 transitions. [2025-03-03 15:15:45,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:45,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-03-03 15:15:45,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:45,241 INFO L225 Difference]: With dead ends: 109631 [2025-03-03 15:15:45,241 INFO L226 Difference]: Without dead ends: 54877 [2025-03-03 15:15:45,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:45,278 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 81 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:45,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 381 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:45,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54877 states. [2025-03-03 15:15:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54877 to 54875. [2025-03-03 15:15:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54875 states, 54874 states have (on average 1.3489266319203994) internal successors, (74021), 54874 states have internal predecessors, (74021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54875 states to 54875 states and 74021 transitions. [2025-03-03 15:15:45,871 INFO L78 Accepts]: Start accepts. Automaton has 54875 states and 74021 transitions. Word has length 149 [2025-03-03 15:15:45,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:45,871 INFO L471 AbstractCegarLoop]: Abstraction has 54875 states and 74021 transitions. [2025-03-03 15:15:45,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:45,871 INFO L276 IsEmpty]: Start isEmpty. Operand 54875 states and 74021 transitions. [2025-03-03 15:15:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 15:15:45,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:45,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:45,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-03 15:15:45,875 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:45,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:45,876 INFO L85 PathProgramCache]: Analyzing trace with hash -395837479, now seen corresponding path program 1 times [2025-03-03 15:15:45,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:45,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884574058] [2025-03-03 15:15:45,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:45,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:45,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 15:15:45,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 15:15:45,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:45,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:46,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:46,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884574058] [2025-03-03 15:15:46,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884574058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:15:46,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402592179] [2025-03-03 15:15:46,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:46,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:15:46,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:15:46,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:15:46,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:15:46,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 15:15:46,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 15:15:46,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:46,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:46,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 15:15:46,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:15:47,299 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:47,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:15:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:48,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402592179] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:15:48,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:15:48,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 25 [2025-03-03 15:15:48,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120119589] [2025-03-03 15:15:48,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:15:48,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 15:15:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:48,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 15:15:48,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:15:48,616 INFO L87 Difference]: Start difference. First operand 54875 states and 74021 transitions. Second operand has 26 states, 26 states have (on average 14.576923076923077) internal successors, (379), 25 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:50,462 INFO L93 Difference]: Finished difference Result 273699 states and 366888 transitions. [2025-03-03 15:15:50,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-03 15:15:50,462 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 14.576923076923077) internal successors, (379), 25 states have internal predecessors, (379), 0 states have call successors, (0), 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 149 [2025-03-03 15:15:50,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:50,712 INFO L225 Difference]: With dead ends: 273699 [2025-03-03 15:15:50,712 INFO L226 Difference]: Without dead ends: 218945 [2025-03-03 15:15:50,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=893, Invalid=3013, Unknown=0, NotChecked=0, Total=3906 [2025-03-03 15:15:50,795 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1959 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1959 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:50,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1959 Valid, 1827 Invalid, 1862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:15:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218945 states. [2025-03-03 15:15:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218945 to 115945. [2025-03-03 15:15:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115945 states, 115944 states have (on average 1.34012109294142) internal successors, (155379), 115944 states have internal predecessors, (155379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115945 states to 115945 states and 155379 transitions. [2025-03-03 15:15:52,632 INFO L78 Accepts]: Start accepts. Automaton has 115945 states and 155379 transitions. Word has length 149 [2025-03-03 15:15:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:52,632 INFO L471 AbstractCegarLoop]: Abstraction has 115945 states and 155379 transitions. [2025-03-03 15:15:52,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 14.576923076923077) internal successors, (379), 25 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 115945 states and 155379 transitions. [2025-03-03 15:15:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 15:15:52,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:52,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:52,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:15:52,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2025-03-03 15:15:52,841 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:52,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:52,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1635937040, now seen corresponding path program 1 times [2025-03-03 15:15:52,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:52,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700685806] [2025-03-03 15:15:52,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:52,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 15:15:52,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 15:15:52,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:52,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 15:15:52,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:52,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700685806] [2025-03-03 15:15:52,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700685806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:52,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:52,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:15:52,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087821339] [2025-03-03 15:15:52,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:52,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:15:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:52,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:15:52,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:52,897 INFO L87 Difference]: Start difference. First operand 115945 states and 155379 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:53,257 INFO L93 Difference]: Finished difference Result 224203 states and 301700 transitions. [2025-03-03 15:15:53,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:15:53,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 150 [2025-03-03 15:15:53,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:53,373 INFO L225 Difference]: With dead ends: 224203 [2025-03-03 15:15:53,373 INFO L226 Difference]: Without dead ends: 108393 [2025-03-03 15:15:53,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:15:53,442 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 124 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:53,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 160 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:15:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108393 states. [2025-03-03 15:15:54,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108393 to 108393. [2025-03-03 15:15:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108393 states, 108392 states have (on average 1.339757546682412) internal successors, (145219), 108392 states have internal predecessors, (145219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108393 states to 108393 states and 145219 transitions. [2025-03-03 15:15:55,555 INFO L78 Accepts]: Start accepts. Automaton has 108393 states and 145219 transitions. Word has length 150 [2025-03-03 15:15:55,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:55,555 INFO L471 AbstractCegarLoop]: Abstraction has 108393 states and 145219 transitions. [2025-03-03 15:15:55,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 108393 states and 145219 transitions. [2025-03-03 15:15:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 15:15:55,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:55,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:15:55,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-03-03 15:15:55,563 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-03 15:15:55,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:55,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1552928507, now seen corresponding path program 1 times [2025-03-03 15:15:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:55,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067495859] [2025-03-03 15:15:55,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:55,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 15:15:55,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 15:15:55,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:55,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:56,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067495859] [2025-03-03 15:15:56,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067495859] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:15:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18443592] [2025-03-03 15:15:56,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:56,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:15:56,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:15:56,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:15:56,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:15:56,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 15:15:56,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 15:15:56,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:56,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:56,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 15:15:56,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:15:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:57,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:15:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:58,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18443592] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:15:58,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:15:58,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 32 [2025-03-03 15:15:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229334795] [2025-03-03 15:15:58,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:15:58,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 15:15:58,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:58,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 15:15:58,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 15:15:58,272 INFO L87 Difference]: Start difference. First operand 108393 states and 145219 transitions. Second operand has 33 states, 33 states have (on average 12.93939393939394) internal successors, (427), 32 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)